900 research outputs found
Foundations of Rule-Based Query Answering
This survey article introduces into the essential concepts and methods underlying rule-based query languages. It covers four complementary areas: declarative semantics based on adaptations of mathematical logic, operational semantics, complexity and expressive power, and optimisation of query evaluation.
The treatment of these areas is foundation-oriented, the foundations having resulted from over four decades of research in the logic programming and database communities on combinations of query languages and rules. These results have later formed the basis for conceiving, improving, and implementing several Web and Semantic Web technologies, in particular query languages such as XQuery or SPARQL for querying relational, XML, and RDF data, and rule languages like the āRule Interchange Framework (RIF)ā currently being developed in a working group of the W3C.
Coverage of the article is deliberately limited to declarative languages in a classical setting: issues such as query answering in F-Logic or in description logics, or the relationship of query answering to reactive rules and events, are not addressed
Beyond the grounding bottleneck: Datalog techniques for inference in probabilistic logic programs
State-of-the-art inference approaches in probabilistic logic programming
typically start by computing the relevant ground program with respect to the
queries of interest, and then use this program for probabilistic inference
using knowledge compilation and weighted model counting. We propose an
alternative approach that uses efficient Datalog techniques to integrate
knowledge compilation with forward reasoning with a non-ground program. This
effectively eliminates the grounding bottleneck that so far has prohibited the
application of probabilistic logic programming in query answering scenarios
over knowledge graphs, while also providing fast approximations on classical
benchmarks in the field
The -semantics approach; theory and applications
AbstractThis paper is a general overview of an approach to the semantics of logic programs whose aim is to find notions of models which really capture the operational semantics, and are, therefore, useful for defining program equivalences and for semantics-based program analysis. The approach leads to the introduction of extended interpretations which are more expressive than Herbrand interpretations. The semantics in terms of extended interpretations can be obtained as a result of both an operational (top-down) and a fixpoint (bottom-up) construction. It can also be characterized from the model-theoretic viewpoint, by defining a set of extended models which contains standard Herbrand models. We discuss the original construction modeling computed answer substitutions, its compositional version, and various semantics modeling more concrete observables. We then show how the approach can be applied to several extensions of positive logic programs. We finally consider some applications, mainly in the area of semantics-based program transformation and analysis
Proceedings of the Workshop on the lambda-Prolog Programming Language
The expressiveness of logic programs can be greatly increased over first-order Horn clauses through a stronger emphasis on logical connectives and by admitting various forms of higher-order quantification. The logic of hereditary Harrop formulas and the notion of uniform proof have been developed to provide a foundation for more expressive logic programming languages. The Ī»-Prolog language is actively being developed on top of these foundational considerations. The rich logical foundations of Ī»-Prolog provides it with declarative approaches to modular programming, hypothetical reasoning, higher-order programming, polymorphic typing, and meta-programming. These aspects of Ī»-Prolog have made it valuable as a higher-level language for the specification and implementation of programs in numerous areas, including natural language, automated reasoning, program transformation, and databases
Bottom-Up Grounding in the Probabilistic Logic Programming System Fusemate
This paper introduces the Fusemate probabilistic logic programming system.
Fusemate's inference engine comprises a grounding component and a variable
elimination method for probabilistic inference. Fusemate differs from most
other systems by grounding the program in a bottom-up way instead of the common
top-down way. While bottom-up grounding is attractive for a number of reasons,
e.g., for dynamically creating distributions of varying support sizes, it makes
it harder to control the amount of ground clauses generated. We address this
problem by interleaving grounding (along program stratification) with a
query-guided relevance test. This test prunes ground rules whose heads are
inconsistent with the query dynamically extended by the ground rules so far. We
present our method in detail and demonstrate it with examples that involve
``time'', such as (hidden) Markov models. Our experiments demonstrate
competitive or better performance compared to a state-of-the probabilistic
logic programming system, in particular for high branching problems
- ā¦