Non-Clausal Reasoning with Definite Theories

Authors:
Zbigniew Stachniak
Affiliations:
Department of Computer Science, York University, Toronto, Canada
Venue:
Fundamenta Informaticae
Year:
2001

Citing 16
Cited 0

Special relations in automated deduction

Journal of the ACM (JACM) - The MIT Press scientific computation series
A Structure-preserving Clause Form Translation

Journal of Symbolic Computation
Foundations of logic programming; (2nd extended ed.)

Foundations of logic programming; (2nd extended ed.)
Strategies for modal resolution: results and problems

Journal of Automated Reasoning
A resolution framework for finitely-valued first-order logics

Journal of Symbolic Computation
Characterizing diagnoses and systems

Artificial Intelligence
Automated deduction in multiple-valued logics

Automated deduction in multiple-valued logics
Resolution proof systems: an algebraic theory

Resolution proof systems: an algebraic theory
Resolution and model building in the infinite-valued calculus of Łukasiewicz

Theoretical Computer Science
Polarity guided tractable reasoning

AAAI '99/IAAI '99 Proceedings of the sixteenth national conference on Artificial intelligence and the eleventh Innovative applications of artificial intelligence conference innovative applications of artificial intelligence
A Machine-Oriented Logic Based on the Resolution Principle

Journal of the ACM (JACM)
Automatic SAT-compilation of planning problems

IJCAI'97 Proceedings of the Fifteenth international joint conference on Artifical intelligence - Volume 2
Exploiting locality in a TMS

AAAI'90 Proceedings of the eighth National conference on Artificial intelligence - Volume 1
Truth maintenance

AAAI'90 Proceedings of the eighth National conference on Artificial intelligence - Volume 2
Connection based strategies for deciding propositional temporal logic

AAAI'97/IAAI'97 Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of artificial intelligence
Model-theoretic semantics and tractable algorithm for CNF-BCP

AAAI'97/IAAI'97 Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of artificial intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we propose a general-purpose first-order automated reasoning framework based on the notion of a definite formula and on a non-clausal variant of SLD-resolution. This framework provides a universal Horn clause-like representation of knowledge for classical as well as a range of non-classical first-order logics. It provides a resolution-style method for automated reasoning with theories of definite formulas.