Sciweavers

827 search results - page 98 / 166
» Proof-Theoretic Soundness and Completeness
Sort
View
INFFUS
2006
104views more  INFFUS 2006»
14 years 10 months ago
Reasoning with multiple-source information in a possibilistic logic framework
This paper addresses the problem of merging uncertain information in the framework of possibilistic logic. It presents several syntactic combination rules to merge possibilistic k...
Salem Benferhat, Claudio Sossai
INFORMATICALT
2006
115views more  INFORMATICALT 2006»
14 years 10 months ago
Sequent Calculi for Temporal Logics of Common Knowledge and Belief
In this paper we consider two logics: temporal logic of common knowledge and temporal logic of common belief. These logics involve the discrete time linear temporal logic operators...
Jurate Sakalauskaite
JAIR
2006
106views more  JAIR 2006»
14 years 10 months ago
Clause/Term Resolution and Learning in the Evaluation of Quantified Boolean Formulas
Resolution is the rule of inference at the basis of most procedures for automated reasoning. In these procedures, the input formula is first translated into an equisatisfiable for...
Enrico Giunchiglia, Massimo Narizzano, Armando Tac...
DKE
2007
136views more  DKE 2007»
14 years 10 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
JOLLI
2006
76views more  JOLLI 2006»
14 years 10 months ago
A Modal Interpretation of the Logic of Interrogation
We propose a novel interpretation of natural-language questions using a modal predicate logic of knowledge. Our approach brings standard model-theoretic and proof-theoretic techniq...
Rani Nelken, Chung-chieh Shan