Query Answering in Belief Logic Programming
نویسندگان
چکیده
In this paper we introduce a fixpoint semantics for quantitative logic programming, which is able to both combine and correlate evidence from different sources of information. Based on this semantics, we develop efficient algorithms that can answer queries for non-ground programs with the help of an SLD-like procedure. We also analyze the computational complexity of the algorithms and illustrate their uses.
منابع مشابه
A top-k query answering procedure for fuzzy logic programming
We present a top-k query answering procedure for Fuzzy Logic Programming, in which arbitrary computable functions may appear in the rule bodies to manipulate truth values. The top-k ranking problem, i.e. determining the top k answers to a query, becomes important as soon as the set of facts becomes quite large. © 2012 Elsevier B.V. All rights reserved.
متن کاملRewriting Conjunctive Queries under Description Logic Constraints
We consider the problems of conjunctive query answering and rewriting under Description Logic constraints. We present a query rewriting algorithm for ELHI knowledge bases, and use it to show that query answering in this setting is PTime-complete w.r.t. data complexity. We show that our algorithm is worst-case optimal for languages with data complexity of query answering ranging from LogSpace to...
متن کاملRewriting Conjunctive Queries under Description Logic Constraints ( Technical Report )
We consider the problems of conjunctive query answering and rewriting under Description Logic constraints. We present a query rewriting algorithm for ELHI knowledge bases, and use it to show that query answering in this setting is PTime-complete w.r.t. data complexity. We show that our algorithm is worst-case optimal for languages with data complexity of query answering ranging from LogSpace to...
متن کاملOn the Interaction of Existential Rules and Equality Constraints in Ontology Querying
Ontological query processing is an exciting research topic in database theory, knowledge representation, and logic programming. In many cases, ontological constraints are expressed over an extensional database by extending traditional Datalog rules to allow existential quantification and equality atoms in the head. The unrestricted use of these features causes undecidability of query answering ...
متن کاملApproximate Query Answering in Inconsistent Databases
Classical algorithms for query optimization presuppose the absence of inconsistencies or uncertainties in the database and exploit only valid semantic knowledge provided, e.g., by integrity constraints. Data inconsistency or uncertainty, however, is a widespread critical issue in ordinary databases: total integrity is often, in fact, an unrealistic assumption and violations to integrity constra...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009