Results 201 to 210 of about 3,597,563 (258)

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.
de Rijke, M., Areces, C.E., de Nivelle, J.M.G.G.   +2 more
openaire   +4 more sources

Resolution for propositional logic

1990
Abstract Resolution comprises a single inference rule applicable to clausal-form logic. Briefly, from any two clauses having an appropriate form, resolution derives a new clause as their consequence. It is best explained by first showing how it works in the special case of propositional clausal form.
openaire   +1 more source

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   +2 more sources

Logical propositions and debate resolutions

Central States Speech Journal, 1960
The argument that “it is unethical to argue both sides of a debate resolution”; is unsound insofar as the argument assumes that factual and logical considerations are relevant to resolutions and that convictions are relevant to argument.
openaire   +1 more source

Logic and Computation

, 2023
A. Parkes
semanticscholar   +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

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.
Schmidt, R.A., Hustadt, Ullrich
openaire   +1 more source

Resolution-Based Theorem Proving for SH n-Logics

2000
. In this paper we illustrate by means of an example, namely SHn-logics, a method for translation to clause form and automated theorem proving for first-order many-valued logics based on distributive lattices with operators.
openaire   +3 more sources

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