Results 221 to 230 of about 45,065 (245)
Some of the next articles are maybe not open access.

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

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

Fuzzy Logic and the Resolution Principle

Journal of the ACM, 1972
ABSTRACT The relationship between fuzzy logic and two-valued logic in the context of the first order predicate calculus is discussed. It is proved that if every clause in a set of clauses is something more than a “half-truth” and the most reliable clause has truth-value a and the most unreliable clause has truth-value b , then we are guaranteed ...
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 logics.
openaire   +2 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

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   +4 more
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.
Christian G. Fermüller, Matthias Baaz
openaire   +2 more sources

Clausal resolution for normal modal logics

Journal of Algorithms, 2007
We present a clausal resolution-based method for normal modal logics. Differently from other approaches, where inference rules are based on the syntax of a particular set of axioms, we focus on the restrictions imposed on the binary accessibility relation for each particular normal logic.
Nalon, C., Dixon, C.
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

Public administration and the logic of resolution

Critical Policy Studies, 2016
ABSTRACTThrough a critical reading of Wilson’s 1887 article, I propose a political logic of public administration, what I call the logic of resolution. A central but neglected aspect of Wilson’s article is the focus and importance of closure and creation, both of which underscore how public administration emerged not only as an area of study, but also ...
openaire   +2 more sources

Home - About - Disclaimer - Privacy