| BibTeX cite key | Author/Editor | Year | | Title | Type |
|---|
| KraanBasinBundy93b | Kraan, Ina
Basin, David A.
Bundy, Alan | 1993 | | Middle-Out Reasoning for Logic Program Synthesis
In: Proc.~10th Intern. Conference on Logic Programing (ICLP '93), 441-455 | Proceedings Article |
| KraanBasinBundy96 | Kraan, Ina
Basin, David A.
Bundy, Alan | 1996 | | Middle-out reasoning for synthesis and induction
In: Journal of Automated Reasoning [16], 113-145 | Journal Article |
| KrischerBockmayr91a | Krischer, Stefan
Bockmayr, Alexander | 1991 | | Detecting Redundant Narrowing Derivations by the LSE-SL Reducibility Test
In: Proceedings of the 4th International Conference on Rewriting Techniques and Applications (RTA '91), 74-85 | Proceedings Article |
| KrishnaRao95 | Krishna Rao, M. R. K. | 1995 | | Graph reducibility of term rewriting systems
In: Proceedings of Mathematical Foundations of Computer Science, 371-381 | Proceedings Article |
| KrishnaRao96a | Krishna Rao, M. R. K. | 1996 | | A class of Prolog programs inferable from positive data
In: Algorithmic Learning Theory, 272-284 | Proceedings Article |
| KrishnaRao96b | Krishna Rao, M. R. K. | 1996 | | Completeness results for basic narrowing in non-copying implementations
In: Logic Programming, 393-407 | Proceedings Article |
| KrishnaRao96c | Krishna Rao, M. R. K. | 1996 | | Learning Prolog programs from examples
In: Knowledge Based Computer Systems, 19-30 | Proceedings Article |
| KrishnaRao96d | Krishna Rao, M. R. K. | 1996 | | Modularity of termination in term graph rewriting
In: Rewriting Techniques and Applications, 230-244 | Proceedings Article |
| KrishnaRao96e | Krishna Rao, M. R. K. | 1996 | | Some characteristics of strong innermost normalization
In: Algebraic Methodology and Software Technology, 5th International Conference, AMAST '96, 406-420 | Proceedings Article |
| KrishnaRao97a | Krishna Rao, M. R. K. | 1997 | | A framework for incremental learning of logic programs
In: Theoretical Computer Science [185], 191-213 | Journal Article |
| KrishnaRao98a | Krishna Rao, M. R. K. | 1998 | | Modular Aspects of term graph rewriting
In: Theoretical Computer Science [208], 59-86 | Journal Article |
| KrishnaRaoActaInformatica | Krishna Rao, M. R. K. | 1996 | | Relating confluence, innermost-confluence and outermost-confluence properties of term rewriting systems
In: Acta Informatica [33], 595-606 | Journal Article |
| KrishnaRaoALT | Krishna Rao, M. R. K. | 1995 | | Incremental Learning of Logic Programs
In: Proceedings of International Workshop on Algorithmic Learning Theory, 95-109 | Proceedings Article |
| KrishnaRaoSAS | Krishna Rao, M. R. K.
Shyamasundar, R. K. | 1995 | | Unification-free Execution of Well-moded Prolog Programs
In: Proc. of International Static Analysis Symposium, 243-260 | Proceedings Article |
| KrishnaRaoTAPSOFT | Krishna Rao, M. R. K. | 1995 | | Semi-completeness of Hierarchical and Super-hierarchical Combinations of Term Rewriting Systems
In: Proceedings of the 6th Joint Conference on Theory and Practice of Software Development, 379-393 | Proceedings Article |
| KrishnaRaoTCS | Krishna Rao, M. R. K. | 1995 | | Modular Proofs for Completeness of hierarchical term rewriting systems
In: Theoretical Computer Science [151], 487-512 | Journal Article |
| KupferschmidEtAl2006 | Kupferschmid, Sebastian
Hoffmann, Jörg
Dierks, Henning
Behrmann, Gerd | 2006 | | Adapting an AI Planning Heuristic for Directed Model Checking
In: Model checking software : 13th International SPIN Workshop, 35-52 | Proceedings Article |
| Lee2004 | Lee, Chin Soon | 2004 | | Size-change Termination Analyzer | Unpublished/Draft |
| Lee2009 | Lee, Chin Soon | 2009 | | Ranking functions for size-change termination
In: ACM Transactions on Programming Languages and Systems [31], 10:1-10:42 | Journal Article |
| lepl:94a | Lee, Shie-Jue
Plaisted, David A. | 1994 | | Problem solving by searching for models with a theorem prover
In: Artificial Intelligence [69], 205-233 | Journal Article |
| lepl:94b | Lee, Shie-Jue
Plaisted, David A. | 1994 | | Use of replace rules in theorem proving
In: Methods of Logic in Computer Science [1], 217-240 | Journal Article |
| LETZ03 | Letz, Reinhold
Stenz, Gernot | 2003 | | Universal variables in disconnection tableaux
In: Automated reasoning with analytical tableaux and related methods : International Conference, TABLEAUX 2003, 117-133 | Proceedings Article |
| LetzWeidenbach98 | Letz, Reinhold
Weidenbach, Christoph | 1998 | | Paradigmen und Perspektiven der automatischen Deduktion
In: KI, Organ des Fachbereichs 1 "Künstliche Intelligenz'' der Gesellschaft für Informatik e.V. [4], 15-19 | Journal Article |
| LeuschelPodelski2004 | Podelski, Andreas | 2004 | | Introduction to the Special Issue on Verification and Computational Logic
In: Theory and Practice of Logic Programming (TPLP) [4], 541-751 | Journal Article |
| Leven-Diplom98 | Leven, Peter | 1998 | | Integrating Clausal Decision Procedures in a Tactic Based Theorem Prover
Universität des Saarlandes | Thesis - Masters thesis |
| LevyVeanes99 | Levy, Jordi
Veanes, Margus | 2000 | | On the Undecidability of Second-Order Unification
In: Information and Computation [159], 125-150 | Journal Article |
| LisaCSL | Abdelwaheb, Ayari
Basin, David A.
Podelski, Andreas | 1998 | | LISA: A Specification Language Based on WS2S
In: Proceedings of the 11th International Workshop on Computer Science Logic (CSL-97), 18-34 | Proceedings Article |
| LoechnerHillenbrandAICOM2002 | Löchner, Bernd
Hillenbrand, Thomas | 2002 |  | A Phytography of WALDMEISTER
In: AI Communications [15], 127-133 | Journal Article |
| LuWu1999 | Lu, Mi
Wu, Jinzhao | 2000 | | On Theorem proving in Annotated Logics
In: Journal of Applied Non-Classical Logics [10], 121-143 | Journal Article |
| Madden-1992 | Madden, Peter | 1992 | | Automated Program Transformation Through Proof Transformation
In: Proceedings of the 11th International Conference on Automated Deduction (CADE-11), 446-460 | Proceedings Article |
