Results 261 to 270 of about 49,509 (302)

A resolution principle for constrained logics

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

Propositional Logic: Resolution

2012
The method of resolution, invented by J.A. Robinson in 1965, is an efficient method for searching for a proof. In this section, we introduce resolution for the propositional logic, though its advantages will not become apparent until it is extended to first-order logic.
openaire   +2 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   +4 more sources

Resolution-based methods for modal logics

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

A logic approach to the resolution of constraints in timetabling

European Journal of Operational Research, 1992
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Le Kang, George M. White
openaire   +2 more sources

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 ...
Cláudia Nalon, Lan Zhang, Clare Dixon, Paul Gainer, Ullrich Hustadt   +4 more
openaire   +1 more source

Fuzzy operator logic and fuzzy resolution

Journal of Automated Reasoning, 1993
The paper presents an attempt to adapt resolution-based theorem proving techniques to fuzzy modelling of uncertainty. Within the first two sections, some general arguments are supplied to justify the approach. The FOpL calculus (Fuzzy Operator Logic) is introduced in the next section.
Thomas J. Weigert, Jeffrey J. P. Tsai, Xu-Hua Liu   +2 more
openaire   +3 more sources

The completeness of gp-resolution for annotated logics

Information Processing Letters, 1992
We show that \(gp\)-resolution is refutation complete for arbitrary sets of clauses. As a by-product, we show that the merging operation in \(gp\)- resolution may be simplified.
James J. Lu, Lawrence J. Henschen
openaire   +3 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.
Christian G. Fermüller, Matthias Baaz
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   +2 more sources