| BibTeX cite key | Author/Editor | Year | | Title | Type |
|---|
| KasperDiss1998 | Kasper, Thomas | 1998 | | A Unifying Logical Framework for Integer Linear Programming and Finite Domain Constraint Programming
Universität des Saarlandes | Thesis - PhD thesis |
| Kazakov03SubsumptionFLzero | Kazakov, Yevgeny
de Nivelle, Hans | 2003 |  | Subsumption of Concepts in $FL_0$ for (Cyclic) Terminologies with Respect to Descriptive Semantics is PSPACE-complete
In: 2003 International Workshop on Description Logics (DL-03), 56-64 | Proceedings Article |
| Kazakov04GF2N | Kazakov, Yevgeny | 2004 | | A Polynomial Translation from the Two-Variable Guarded Fragment with Number Restrictions to the Guarded Fragment
In: Logics in artificial intelligence : 9th European Conference, JELIA 2004, 372-384 | Proceedings Article |
| Kazakov2002 | Kazakov, Yevgeny | 2002 | | Recursive resolution for modal logic
In: Symposium on the Effectiveness of Logic in Computer Science in Honour of Moshe Vardi, 11-15 | Proceedings Article |
| Kazakov2005 | Kazakov, Yevgeny | 2006 | | Saturation-Based Decision Procedures For Extensions Of The Guarded Fragment
Universität des Saarlandes | Thesis - PhD thesis |
| KazNiv04ResGFTG | Kazakov, Yevgeny
de Nivelle, Hans | 2004 | | A Resolution Decision Procedure for the Guarded Fragment with Transitive Guards
In: Automated reasoning : Second International Joint Conference, IJCAR 2004, 122-136 | Proceedings Article |
| Klotzki-Mastersthesis95 | Klotzki, Pia | 1995 | | Wiedemann-Algorithmus zur Lösung dünnbesetzter Gleichungssysteme über Fp
Universität des Saarlandes | Thesis - Masters thesis |
| KorovinPhD2003 | Korovin, Konstantin | 2003 | | Knuth-Bendix orders in automated deduction and term rewriting
University of Manchester | Thesis - PhD thesis |
| KorovinVoronkov:CADE03:ACKBO | Korovin, Konstantin
Voronkov, Andrei | 2003 | | AC-compatible Knuth-Bendix Order
In: Automated deduction, CADE-19 : 19th International Conference on Automated Deduction, 47-59 | Proceedings Article |
| KorovinVoronkov:IC:2003 | Korovin, Konstantin
Voronkov, Andrei | 2003 | | Orienting rewrite rules with the Knuth-Bendix order
In: Information and Computation [183], 165-186 | Journal Article |
| KorovinVoronkov:LICS03:EqOrientability | Korovin, Konstantin
Voronkov, Andrei | 2003 | | Orienting Equalities with the Knuth-Bendix Order
In: 18th Annual IEEE Symposium on Logic in Computer Science (LICS-03), 75-84 | Proceedings Article |
| KorovinVoronkov:TOCL:2004 | Korovin, Konstantin
Voronkov, Andrei | 2005 | | Knuth-Bendix constraint solving is NP-complete
In: ACM Transactions on Computational Logic [6], 361-388 | Journal Article |
| KraanBasinBundy93a | Kraan, Ina
Basin, David A.
Bundy, Alan | 1993 | | Logic Program Synthesis via Proof Planning
In: International Workshop on Logic Program Synthesis and Transformation (LOPSTR '92), 1-14 | Proceedings Article |
| 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 |
