Your search returned the following 16 documents:
-
A Framework for Circular Assume-Guarantee Rules
Patrick Maier
In: Symposium on the Effectiveness of Logic in Computer Science in Honour of Moshe Vardi, Saarbrücken, Germany, March 4 - 6, 2002, 2002, 55-58
-
Is Logic Effective for Analyzing C Programs?
Thomas Hillenbrand, Andreas Podelski, and Dalibor Topić
In: Symposium on the Effectiveness of Logic in Computer Science in Honour of Moshe Vardi, Saarbrücken, 2002, 27-30
[PS: Download: analysis.ps]
-
Recursive resolution for modal logic
Yevgeny Kazakov
In: Symposium on the Effectiveness of Logic in Computer Science in Honour of Moshe Vardi, Saarbrücken, Germany, 2002, 11-15
[Download: RecResML.dvi]
-
Deduction
Ulrich Furbach, Harald Ganzinger, Ryuzo Hasegawa, and Deepak Kapur(Ed.)
Dagstuhl-Seminar-Report. , IBFI, Wadern, 2000
-
Cancellative Superposition Decides the Theory of Divisible Torsion-Free Abelian Groups
Uwe Waldmann
In: Proceedings of the 6th International Conference on Logic for Programming and Automated Reasoning (LPAR-99), Tbilisi, Georgia, September 6-10, 1999, 131-147. Note: %Earlier version: Technical Report MPI-I-1999-2-003, Max-Planck-Institut für
Informatik, Saarbrücken
-
Maslov's Class K Revisited
Ullrich Hustadt and Renate A. Schmidt
In: Proceedings of the 16th International Conference on Automated Deduction (CADE-16), Trento, Italy, July, 7 - 10, 1999, 172-186
-
On the Universal Theory of Varieties of Distributive Lattices with Operators: Some Decidability and Complexity Results
Viorica Sofronie-Stokkermans
In: Proceedings of the 16th International Conference on Automated Deduction (CADE-16), Trento, Italy, July 7-10, 1999, 1999, 157-171
[PDF: Download: cade-99.pdf]
-
Prefixed Resolution: A Resolution Method for Modal and Description Logics
Hans de Nivelle, Carlos Areces, and Maarten de Rijke
In: Proceedings of the 16th International Conference on Automated Deduction (CADE-16), Trento, Italy, July 7-10, 1999, 1999, 187-201
-
Proceedings of the 16th International Conference on Automated Deduction (CADE-16)
Harald Ganzinger(Eds.)
Lecture Notes in Artificial Intelligence. 1632, , Springer, Berlin, 1999
-
Proceedings of the 6th International Conference on Logic for Programming and Automated Reasoning (LPAR-99)
Harald Ganzinger, David McAllester, and Andrei Voronkov(Ed.)
Lecture Notes in Artificial Intelligence. 1705, , Springer, Berlin, 1999. Note: Earlier version: Technical Report MPI-I-1999-2-003, Max-Planck-Institut für
Informatik, Saarbrücken
-
System Description: SPASS Version 1.0.0
Christoph Weidenbach, Bijan Afshordel, Uwe Brahm, Christian Cohrs, Thorsten Engel, Enno Keen, Christian Theobalt, and Dalibor Topić
In: Proceedings of the 16th International Conference on Automated Deduction (CADE-16), Trento, Italy, 1999, 314-318
-
Towards an Automatic Analysis of Security Protocols in First-Order Logic
Christoph Weidenbach
In: Proceedings of the 16th International Conference on Automated Deduction (CADE-16), Trento, Italy, July 7-10, 1999, 1999, 378-382
-
Inductive theorem proving by consistency for first-order clauses
Harald Ganzinger and Jürgen Stuber
In: Informatik - Festschrift zum 60. Geburtstag von Günter Hotz, 1992, 441-462. Note: Also in Proc.~CTRS'92, LNCS~656, pp.~226--241
-
Modularity of termination in term graph rewriting
M. R. K. Krishna Rao
In: Rewriting Techniques and Applications, New Brunswick, July, 1996, 230-244
-
Rewriting Techniques and Applications, 7th International Conference, RTA-96
Harald Ganzinger(Eds.)
Lecture Notes in Computer Science. 1103, , Springer, Berlin, 1996. Note: One of the conferences participating in the 1996 Federated Logic Conference
(FLoC)
-
Superposition Theorem Proving for Abelian Groups Represented as Integer Modules
Jürgen Stuber
In: Rewriting Techniques and Applications, 7th International Conference, RTA-96, New Brunswick, USA, July 1996, 1996, 33-47