Sciweavers

194 search results - page 20 / 39
» Justifications for Logic Programs under Answer Set Semantics
Sort
View
DLOG
2008
14 years 12 months ago
Taming the Infinite Chase: Query Answering under Expressive Relational Constraints
Answering queries posed over knowledge bases is a central problem in knowledge representation and database theory. In databases, query containment is one of the important query op...
Andrea Calì, Georg Gottlob, Michael Kifer
LPNMR
2001
Springer
15 years 2 months ago
Fixpoint Characterizations for Many-Valued Disjunctive Logic Programs with Probabilistic Semantics
In this paper, we continue to explore many-valued disjunctive logic programs with probabilistic semantics. In particular, we newly introduce the least model state semantics for suc...
Thomas Lukasiewicz
173
Voted
ICLP
2009
Springer
15 years 10 months ago
Using Histograms to Better Answer Queries to Probabilistic Logic Programs
Probabilistic logic programs (PLPs) define a set of probability distribution functions (PDFs) over the set of all Herbrand interpretations of the underlying logical language. When...
Matthias Broecheler, Gerardo I. Simari, V. S. Subr...
CORR
2011
Springer
180views Education» more  CORR 2011»
14 years 4 months ago
Representing First-Order Causal Theories by Logic Programs
Nonmonotonic causal logic, introduced by Norman McCain and Hudson Turner, became a basis for the semantics of several expressive action languages. McCain’s embedding of definit...
Paolo Ferraris, Joohyung Lee, Yuliya Lierler, Vlad...
LPNMR
2009
Springer
15 years 4 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