Efficient top-down computation of queries under the well-founded semantics
نویسندگان
چکیده
منابع مشابه
Efficient Top-Down Computation of Queries under the Well-Founded Semantics
The well-founded model provides a natural and robust semantics for logic programs with negative literals in the bodies of rules. Although various procedural semantics have been proposed for query evaluation under the well-founded semantics, the practical issues of implementation for eeective and eecient computation of queries have been rarely discussed. This paper investigates two major impleme...
متن کاملA Top-Down Procedure for Disjunctive Well-Founded Semantics
Skepticism is one of the most important semantic intuitions in artificial intelligence. The semantics formalizing skeptical reasoning in (disjunctive) logic programming is usually named well-founded semantics. However, the issue of defining and computing the well-founded semantics for disjunctive programs and databases has proved to be far more complex and difficult than for normal logic progra...
متن کاملEfficient Computation of the Well-Founded Semantics over Big Data
Data originating from theWeb, sensor readings and social media result in increasingly huge datasets. The so called Big Data comes with new scientific and technological challenges while creating new opportunities, hence the increasing interest in academia and industry. Traditionally, logic programming has focused on complex knowledge structures/programs, so the question arises whether and how it...
متن کاملForgetting under the Well-Founded Semantics
Recently, the notion of forgetting has drawn considerable attention in the area of Knowledge Representation and Reasoning. The underlying idea is to discard a part of the knowledge base without affecting the derivations on, e.g., atoms that are not to be forgotten. Several recent papers consider forgetting under answer set semantics, but sometimes the well-founded semantics with data complexity...
متن کاملDecidability Under the Well-Founded Semantics
The well-founded semantics (WFS) for logic programs is one of the few major paradigms for closed-world reasoning. With the advent of the Semantic Web, it is being used as part of rule systems for ontology reasoning, and also investigated as to its usefulness as a semantics for hybrid systems featuring combined openand closed-world reasoning. Even in its most basic form, however, the WFS is unde...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Journal of Logic Programming
سال: 1995
ISSN: 0743-1066
DOI: 10.1016/0743-1066(94)00028-5