Results 251 to 260 of about 49,509 (302)
Some of the next articles are maybe not open access.
Resolution in Modal, Description and Hybrid Logic
Journal of Logic and Computation, 2001A 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.
Areces, C.E. +2 more
openaire +7 more sources
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 +3 more sources
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 +3 more sources
Prefixed Resolution: A Resolution Method for Modal and Description Logics [PDF]
, 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. +2 more
openaire +3 more sources
Fuzzy Logic and the Resolution Principle
Journal of the ACM, 1972ABSTRACT 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 +3 more sources
Extending resolution to resolution logics
Journal of Experimental & Theoretical Artificial Intelligence, 1991Abstract 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 +2 more sources
Resolution with Order and Selection for Hybrid Logics
Journal of Automated Reasoning, 2010We investigate labeled resolution calculi for hybrid logics with inference rules restricted via selection functions and orders. We start by providing a sound and refutationally complete calculus for the hybrid logic $\mathcal{H}(@,{\downarrow},\mathsf{A})$, even under restrictions by selection functions and orders.
Areces, Carlos, Gorin, Daniel
openaire +2 more sources
Propositional Resolution Logics [PDF]
, 1996 In this chapter, we provide a characterization of the class of propositional resolution logics and delineate the distinct character of resolution logics with strong resolution counterparts. We also study resolution counterparts of disjunctive logics and show that in the presence of disjunction, the deductive process can be based on a single-conclusion ...
openaire +1 more source
1985
In this paper we describe a general way to define a resolution method in the framework of non classical logic.
openaire +3 more sources
In this paper we describe a general way to define a resolution method in the framework of non classical logic.
openaire +3 more sources
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
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
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
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