| Author/Editor [Non Institute] | Year | | Title | Type |
|---|
Kasper
[-] | 1998 | | A Unifying Logical Framework for Integer Linear Programming and Finite Domain Constraint Programming
Universität des Saarlandes | Thesis - PhD thesis |
Kazakov
(Ed: Alferes, Leite)
[-] | 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 |
Kazakov
(Ed: Charatonik, Ganzinger)
[-] | 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 |
Kazakov
[-] | 2006 | | Saturation-Based Decision Procedures For Extensions Of The Guarded Fragment
Universität des Saarlandes | Thesis - PhD thesis |
Kazakov, de Nivelle
(Ed: Basin, Rusinowitch)
[-] | 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 |
Kazakov, de Nivelle
(Ed: Calvanese, De Giacomo, Franconi)
[-] | 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 |
Klotzki
[-] | 1995 | | Wiedemann-Algorithmus zur Lösung dünnbesetzter Gleichungssysteme über Fp
Universität des Saarlandes | Thesis - Masters thesis |
Korovin
[-] | 2003 | | Knuth-Bendix orders in automated deduction and term rewriting
University of Manchester | Thesis - PhD thesis |
Korovin, Voronkov
(Ed: Baader)
[-] | 2003 | | AC-compatible Knuth-Bendix Order
In: Automated deduction, CADE-19 : 19th International Conference on Automated Deduction, 47-59 | Proceedings Article |
Korovin, Voronkov
(Ed: Kolaitis)
[Voronkov, Kolaitis] | 2003 | | Orienting Equalities with the Knuth-Bendix Order
In: 18th Annual IEEE Symposium on Logic in Computer Science (LICS-03), 75-84 | Proceedings Article |
Korovin, Voronkov
[-] | 2005 | | Knuth-Bendix constraint solving is NP-complete
In: ACM Transactions on Computational Logic [6], 361-388 | Journal Article |
Korovin, Voronkov
[-] | 2003 | | Orienting rewrite rules with the Knuth-Bendix order
In: Information and Computation [183], 165-186 | Journal Article |
Kraan, Basin, Bundy
(Ed: Lau, Clement)
[-] | 1993 | | Logic Program Synthesis via Proof Planning
In: International Workshop on Logic Program Synthesis and Transformation (LOPSTR '92), 1-14 | Proceedings Article |
Kraan, Basin, Bundy
(Ed: Zhang)
[Kraan, Bundy] | 1996 | | Middle-Out Reasoning for Synthesis and Induction
In: Automated mathematical induction, 113-145 | Part of a Book |
Kraan, Basin, Bundy
[-] | 1993 | | Middle-Out Reasoning for Logic Program Synthesis
In: Proc.~10th Intern. Conference on Logic Programing (ICLP '93), 441-455 | Proceedings Article |
Kraan, Basin, Bundy
[Kraan, Bundy] | 1996 | | Middle-out reasoning for synthesis and induction
In: Journal of Automated Reasoning [16], 113-145 | Journal Article |
Krischer, Bockmayr
(Ed: Book)
[-] | 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 |
Krishna Rao
(Ed: Anjaneyulu, Sasikumar, Ramani)
[-] | 1996 | | Learning Prolog programs from examples
In: Knowledge Based Computer Systems, 19-30 | Proceedings Article |
Krishna Rao
(Ed: Arikawa, Sharma)
[-] | 1996 | | A class of Prolog programs inferable from positive data
In: Algorithmic Learning Theory, 272-284 | Proceedings Article |
Krishna Rao
(Ed: Ganzinger)
[-] | 1996 | | Modularity of termination in term graph rewriting
In: Rewriting Techniques and Applications, 230-244 | Proceedings Article |
Krishna Rao
(Ed: Jantke, Shinohara, Zeugmann)
[-] | 1995 | | Incremental Learning of Logic Programs
In: Proceedings of International Workshop on Algorithmic Learning Theory, 95-109 | Proceedings Article |
Krishna Rao
(Ed: Maher)
[-] | 1996 | | Completeness results for basic narrowing in non-copying implementations
In: Logic Programming, 393-407 | Proceedings Article |
Krishna Rao
(Ed: Mosses, Nielsen, Schwartzbach)
[Mosses, Nielsen, Schwartzbach] | 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 |
Krishna Rao
(Ed: Wiedermann, Hájek)
[Wiedermann, Hájek] | 1995 | | Graph reducibility of term rewriting systems
In: Proceedings of Mathematical Foundations of Computer Science, 371-381 | Proceedings Article |
Krishna Rao
(Ed: Wirsing, Nivat)
[-] | 1996 | | Some characteristics of strong innermost normalization
In: Algebraic Methodology and Software Technology, 5th International Conference, AMAST '96, 406-420 | Proceedings Article |
Krishna Rao
[-] | 2000 | | Some characteristics of strong innermost normalization
In: Theoretical Computer Science [239], 141-164 | Journal Article |
Krishna Rao
[-] | 2000 | | Some classes of prolog programs inferable from positive data
In: Theoretical Computer Science [241], 211-223 | Journal Article |
Krishna Rao
[-] | 1998 | | Modular Aspects of term graph rewriting
In: Theoretical Computer Science [208], 59-86 | Journal Article |
Krishna Rao
[-] | 1997 | | A framework for incremental learning of logic programs
In: Theoretical Computer Science [185], 191-213 | Journal Article |
Krishna Rao
[-] | 1996 | | Relating confluence, innermost-confluence and outermost-confluence properties of term rewriting systems
In: Acta Informatica [33], 595-606 | Journal Article |
