Author of the publication

Balance and Filtering in Structured Satisfiable Problems (Preliminary Report).

, , , , , and . Electron. Notes Discret. Math., (2001)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

An Introduction to Automated Deduction.. Advanced Course: Fundamentals of Artificial Intelligence, volume 232 of Lecture Notes in Computer Science, page 75-132. Springer, (1985)Deductive Composition of Astronomical Software from Subroutine Libraries., , , , and . CADE, volume 814 of Lecture Notes in Computer Science, page 341-355. Springer, (1994)Balance and Filtering in Structured Satisfiable Problems (Preliminary Report)., , , , , and . Electron. Notes Discret. Math., (2001)A Comparison of the Variable-Abstraction and Constant-Abstraction Methods for Associative-Commutative Unification.. J. Autom. Reason., 3 (3): 285-289 (1987)A Prolog Technology Theorem Prover: Implementation by an Extended Prolog Compiler.. J. Autom. Reason., 4 (4): 353-380 (1988)Detection and elimination of inference channels in multilevel relational database systems., , , , and . S&P, page 196-205. IEEE Computer Society, (1993)Term Rewriting in Contemporary Resolution Theorem Proving (Abstract).. RTA, volume 914 of Lecture Notes in Computer Science, page 101. Springer, (1995)A Prolog Technology Theorem Prover.. CADE, volume 310 of Lecture Notes in Computer Science, page 752-753. Springer, (1988)Building Theorem Provers.. CADE, volume 5663 of Lecture Notes in Computer Science, page 306-321. Springer, (2009)Balance and Filtering in Structured Satisfiable Problems., , , , , and . IJCAI, page 351-358. Morgan Kaufmann, (2001)