Sciweavers

851 search results - page 38 / 171
» Inaccessibility in Decision Procedures
Sort
View
LICS
2003
IEEE
14 years 27 days ago
New Directions in Instantiation-Based Theorem Proving
We consider instantiation-based theorem proving whereby instances of clauses are generated by certain inferences, and where inconsistency is detected by propositional tests. We gi...
Harald Ganzinger, Konstantin Korovin
FTP
1998
Springer
13 years 12 months ago
Issues of Decidability for Description Logics in the Framework of Resolution
Abstract. We describe two methods on the basis of which efficient resolution decision procedures can be developed for a range of description logics. The first method uses an orderi...
Ullrich Hustadt, Renate A. Schmidt
CLIMA
2007
13 years 9 months ago
Analytic Cut-Free Tableaux for Regular Modal Logics of Agent Beliefs
We present a sound and complete tableau calculus for a class BReg of extended regular modal logics which contains useful epistemic logics for reasoning about agent beliefs. Our cal...
Rajeev Goré, Linh Anh Nguyen
DKE
2007
136views more  DKE 2007»
13 years 7 months ago
Deciding XPath containment with MSO
XPath is the standard language for addressing parts of an XML document. We present a sound and complete decision procedure for containment of XPath queries. The considered XPath f...
Pierre Genevès, Nabil Layaïda
JACIII
2008
112views more  JACIII 2008»
13 years 7 months ago
Favoring Consensus and Penalizing Disagreement in Group Decision Making
Abstract. In this paper we introduce a multi-stage decision making procedure where decision makers' opinions are weighted by their contribution to the agreement after they sor...
José Luis García-Lapresta