183 search results - page 7 / 37 » Automated theorem proving by resolution in non-classical log... |
CADE
2003
Springer
14 years 8 months ago
2003
Springer
In this paper we present a translation principle, called the axiomatic translation, for reducing propositional modal logics with background theories, including triangular propertie...
JAIR
2011
13 years 2 months ago
2011
We present a method for using standard techniques from satisfiability checking to automatically verify and discover theorems in an area of economic theory known as ranking sets o...
CSL
1994
Springer
13 years 11 months ago
1994
Springer
We prove the completeness of the combination of ordered resolution and factoring for a large class of non-liftable orderings, without the need for any additional rules like satura...
IJCAI
2003
13 years 9 months ago
2003
We overview the development of first-order automated reasoning systems starting from their early years. Based on the analysis of current and potential applications of such systems...
FUIN
2006
13 years 7 months ago
2006
We prove that negative hyper-resolution using any liftable and well-founded ordering refinement is a sound and complete procedure for answering queries in disjunctive logic program...