Results 111 to 120 of about 58,088 (162)

Ordered Resolution for Coalition Logic

2015
In this paper we introduce a calculus based on ordered resolution for Coalition Logic (CL), improving our previous approach based on unrefined resolution, and discuss the problems associated with imposing an ordering refinement in the context of CL. The calculus operates on ‘coalition problems’, a normal form for CL where we use coalition vectors that ...
Ullrich Hustadt, Paul Gainer, Clare Dixon, Cláudia Nalon, Lan Zhang 0001   +4 more
openaire   +1 more source

Lattices of resolution logics

Proceedings of 24th International Symposium on Multiple-Valued Logic (ISMVL'94), 2002
We study classes of logical calculi which have the same inconsistent sets of formulas. We investigate the algebraic structure of these classes as well as general properties of logical calculi in these classes in the context of the search for efficient resolution based automated reasoning methods. >
openaire   +1 more source

An essay on resolution logics

Studia Logica, 1993
In two papers of the author [Inf. Comput. 96, No. 2, 225-244 (1992; Zbl 0755.03006), J. Exp. Theor. Artif. Intell. 3, 17-32 (1991; Zbl 0723.03004)] the term `resolution logic' is introduced to denote a logical system for which a refutationally complete resolution proof system can be comstructed or, putting it differently, to denote a logical calculus ...
openaire   +2 more sources

Resolution with Order and Selection for Hybrid Logics

Journal of Automated Reasoning, 2010
In the paper the labeled resolution calculus for hybrid logics is presented. The authors show that the general framework of saturation-based reasoning for first-order logic with equality can be adapted to calculi for other logics. They show then that the calculus presented is complete for any admissible order and selection function. It gives a decision
Carlos Areces, Daniel Gorín
openaire   +1 more source

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

Extending resolution to resolution logics

Journal of Experimental & Theoretical Artificial Intelligence, 1991
Abstract In previous papers (O'Hearn & Stachniak 1989b, Stachniak & O'Hearn 1990, Stachniak 1989,1990a) we proposed an algebraic methodological framework for the introduction and analysis of resolution proof systems for finitely-valued logical calculi. In the present paper we extend this approach to a wider class of the so-called resolution logics.
openaire   +1 more source

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