Results 121 to 130 of about 58,088 (162)

A resolution calculus for modal logics

2005
A syntax transformation is presented that eliminates the modal logic operators from modal logic formulae by shifting the modal context information to the term level. The formulae in the transformed syntax can be brought into conjunctive normal form such that a clause based resolution calculus without any additional inference rule, but with special ...
openaire   +3 more sources

Prefixed Resolution: A Resolution Method for Modal and Description Logics

1999
We provide a resolution-based proof procedure for modal and description logics that improves on previous proposals in a number of important ways. First, it avoids translations into large undecidable logics, and works directly on modal or description logic formulas instead.
Carlos Areces, Hans de Nivelle, Maarten de Rijke   +2 more
openaire   +4 more sources

A Resolution Decision Procedure for Fluted Logic

2000
Fluted logic is a fragment of first-order logic without function symbols in which the arguments of atomic subformulae form ordered sequences. A consequence of this restriction is that, whereas first-order logic is only semi-decidable, fluted logic is decidable.
Renate A. Schmidt, Ullrich Hustadt
openaire   +1 more source

Decidability by Resolution for Propositional Modal Logics

Journal of Automated Reasoning, 1999
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +5 more sources

Logic Programming with Pseudo-Resolution

1992
This paper presents a new proof technique for Automated Reasoning and Logic Programming which based on a generalization of the original Connection Graph paradigm of Kowalski and provides a methodology for Logic Programming in this framework.
openaire   +1 more source

Resolution and quantified epistemic logics

1986
Quantified modal logics have emerged as useful tools in computer science for reasoning about knowledge and belief of agents and systems. An important class of these logics have a possible-world semantics from Kripke. Surprisingly, there has been relatively little work on proof theoretic methods that could be used in automatic deduction systems ...
openaire   +1 more source

Resolution Strategies for the Intuitionistic Logic

1994
This paper presents a general scheme of transforming a cutfree Gentzen-type system into a resolution type system, preserving the structure of derivations. This is a direct extension of the method introduced by Maslov for classical predicate logic. Ideas of the author and Zamov are used to avoid skolemization.
openaire   +1 more source

Heuristics for Resolution in Propositional Logic

2009
One of the reasons for the efficiency of automated theorem systems is the usage of good heuristics. There are different semantic heuristics such as set of support which make use of additional knowledge about the problem at hand. Other widely employed heuristics work well without making any additional assumptions. A heuristic which seems to be generally
openaire   +1 more source

Resolution in Sorted Logic

1997
With regard to improving the efficiency of automated deduction systems, the final word has not yet been spoken. In Chapter 8 we became acquainted with various techniques for pruning search spaces associated with deduction, most of which rely on restricting applications of the resolution and factorization rules.
Rolf Socher-Ambrosius, Patricia Johann
openaire   +1 more source

A Resolution-Based Calculus For Temporal Logics

1995
Das ständig wachsende Interesse an Temporallogiken in zahlreichen Gebieten der Informatik verlangt nach Methoden, mit deren Hilfe effizient und schnell Schlussfolgerungen in diesen Logiken gezogen werden können. Üblicherweise geschieht dies durch die Entwicklung eines implementierten Kalküls, und tatsächlich wurden in den vergangenen Jahren ...
openaire   +3 more sources