Sciweavers

662 search results - page 29 / 133
» Logic Programming with Ordered Disjunction
Sort
View
APAL
2005
154views more  APAL 2005»
13 years 7 months ago
A Sahlqvist theorem for distributive modal logic
In this paper we consider distributive modal logic, a setting in which we may add modalities, such as classical types of modalities as well as weak forms of negation, to the fragm...
Mai Gehrke, Hideo Nagahashi, Yde Venema
SIGMOD
2009
ACM
202views Database» more  SIGMOD 2009»
14 years 7 months ago
ZStream: a cost-based query processor for adaptively detecting composite events
Composite (or Complex) event processing (CEP) systems search sequences of incoming events for occurrences of userspecified event patterns. Recently, they have gained more attentio...
Yuan Mei, Samuel Madden
ICLP
2009
Springer
14 years 8 months ago
One More Decidable Class of Finitely Ground Programs
When a logic program is processed by an answer set solver, the first task is to generate its instantiation. In a recent paper, Calimeri et el. made the idea of efficient instantiat...
Yuliya Lierler, Vladimir Lifschitz
LPNMR
2009
Springer
14 years 2 months ago
Complexity of the Stable Model Semantics for Queries on Incomplete Databases
Abstract. We study the complexity of consistency checking and query answering on incomplete databases for languages ranging from non-recursive Datalog to disjunctive Datalog with n...
Jos de Bruijn, Stijn Heymans
ECAI
2000
Springer
13 years 12 months ago
Logic Programs with Compiled Preferences
Abstract. We describe an approach for compiling dynamic preferences into logic programs under the answer set semantics. An ordered logic program is an extended logic program in whi...
James P. Delgrande, Torsten Schaub, Hans Tompits