Sciweavers

119 search results - page 6 / 24
» Logic of infons: The propositional case
Sort
View
AAAI
2006
13 years 11 months ago
Compilation of Query-Rewriting Problems into Tractable Fragments of Propositional Logic
We consider the problem of rewriting a query efficiently using materialized views. In the context of information integration, this problem has received significant attention in th...
Yolifé Arvelo, Blai Bonet, Maria-Esther Vid...
LPNMR
2007
Springer
14 years 3 months ago
General Default Logic
Abstract. In this paper, we present a logic R for rule bases by introducing a set of rule connectives. We define both the models and extensions of a rule base. The semantics of ex...
Yi Zhou, Fangzhen Lin, Yan Zhang
LICS
2009
IEEE
14 years 4 months ago
Trichotomy in the Complexity of Minimal Inference
We study the complexity of the propositional minimal inference problem. Its complexity has been extensively studied before because of its fundamental importance in artificial int...
Arnaud Durand, Miki Hermann, Gustav Nordh
CORR
2008
Springer
110views Education» more  CORR 2008»
13 years 9 months ago
The Tractability of Model-Checking for LTL: The Good, the Bad, and the Ugly Fragments
In a seminal paper from 1985, Sistla and Clarke showed that the model-checking problem for Linear Temporal Logic (LTL) is either NP-complete or PSPACE-complete, depending on the se...
Michael Bauland, Martin Mundhenk, Thomas Schneider...
FROCOS
2005
Springer
14 years 3 months ago
Connecting a Logical Framework to a First-Order Logic Prover
We present one way of combining a logical framework and first-order logic. The logical framework is used as an interface to a first-order theorem prover. Its main purpose is to k...
Andreas Abel, Thierry Coquand, Ulf Norell