Results 281 to 290 of about 653,229 (328)

Resolution-based methods for modal logics

Logic Journal of IGPL, 2000
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
de Nivelle, H., Hustadt, U., Schmidt, R.
openaire   +2 more sources

A resolution principle for constrained logics

Artificial Intelligence, 1994
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 more sources

Resolution Modal Logics

1985
In this paper we describe a general way to define a resolution method in the framework of non classical logic.
openaire   +2 more sources

Resolution in Modal, Description and Hybrid Logic

Journal of Logic and Computation, 2001
A resolution-based proof procedure for modal, description and hybrid logic is provided. Modern modal theorem provers are generally based on tableau methods, and resolution is used for modal logic by translating modal languages to languages of first-order logic.
Carlos Areces, Maarten de Rijke, Hans de Nivelle   +2 more
openaire   +7 more sources

Resolution for many-valued logics

2005
To achieve efficient proof procedures for quantificational logics with finitely many truth values we extend the classical resolution principle. By generalizing the notion of a semantic tree we demonstrate the completeness of resolution and of some effective refinements.
Matthias Baaz, Christian G. Fermüller
openaire   +1 more source

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

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

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