SCAN—Elimination of predicate quantifiers

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1104, Issue , 1996, Pages 161-165

  Ohlbach, Hans Jürgen ^a  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; AUTOMATION; COMPUTATION THEORY; FORMAL LOGIC; LOGIC PROGRAMMING; PROBLEM SOLVING; RECONFIGURABLE HARDWARE; THEOREM PROVING;

FIRST-ORDER FORMULAS; NON-CLASSICAL LOGIC; PREDICATE LOGIC; PREPOSITIONAL LOGIC; PROBLEM SPECIFICATION; PROPOSITIONAL LOGIC; QUANTIFIER ELIMINATION; TYPICAL APPLICATION;

COMPUTER CIRCUITS;

EID: 84957664700     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61511-3_77     Document Type: Conference Paper

References (6)

1. [Ack35] Wilhelm Ackermann. Untersuchung über das Eliminationsproblem der math- ematischen Logik. Mathematische Annalen, 110:390-413, 1935.
2. [DLS94] Patrick Doherty, Witold Lukaszewics, and Andrzej Szalas. Computing circumscription revisited: A reduction algorithm. Technical Report LiTH-IDA- R-94-42, Institutionen for Datavetenskap, University of Linköping, 1994.
3. [G092a] Dov M. Gabbay and Hans Jürgen Ohlbach. Quantifier elimination in second- order predicate logic. In Bernhard Nebel, Charles Rich, and William Swartout, editors, Principles of Knowledge Representation and Reasoning (KR92), pages 425-435. Morgan Kaufmann, 1992.
4. [G092b] Dov M. Gabbay and Hans Jürgen Ohlbach. Quantifier elimination in second- order predicate logic. South African Computer Journal, 7:35-43, July 1992. also published in [G092a]
5. [KL95] G. Neelakantan Kartha and Vladimir Lifschitz. A simple formalization of actions using circumscription. In Proceedings of IJCAI 95, 1995.
6. th Intema- tion Conference on Automated Deduction, LNAI44, pages 663-664. Springer Verlag, 1990.