Results 251 to 260 of about 46,994 (285)
Prefixed Resolution: A Resolution Method for Modal and Description Logics [PDF]
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
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Resolution in Modal, Description and Hybrid Logic
Journal of Logic and Computation, 2001We provide a resolution-based proof procedure for modal, description and hybrid logic that improves on previous proposals in important ways. It avoids translations into large undecidable logics, and works directly on modal, description or hybrid logic formulas instead.
Areces, C.E.+2 more
openaire +6 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
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
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
Propositional Resolution Logics [PDF]
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