XSB: extending Prolog with tabled logic programming
From MaRDI portal
Abstract: The paradigm of Tabled Logic Programming (TLP) is now supported by a number of Prolog systems, including XSB, YAP Prolog, B-Prolog, Mercury, ALS, and Ciao. The reasons for this are partly theoretical: tabling ensures termination and optimal known complexity for queries to a large class of programs. However the overriding reasons are practical. TLP allows sophisticated programs to be written concisely and efficiently, especially when mechanisms such as tabled negation and call and answer subsumption are supported. As a result TLP has now been used in a variety of applications from program analysis to querying over the semantic web. This paper provides a survey of TLP and its applications as implemented in XSB Prolog, along with discussion of how XSB supports tabling with dynamically changing code, and in a multi-threaded environment.
Recommendations
Cites work
- Concurrent and Local Evaluation of Normal Programs
- Efficient access mechanisms for tabled logic programs
- Extending and implementing the stable model semantics
- Logic Programming with Defaults and Argumentation Theories
- Logic programs with stable model semantics as a constraint programming paradigm
- Logical foundations of object-oriented and frame-based languages
- Preference Logic Grammars: Fixed point semantics and application to data standardization
- Quantitative deduction and its fixpoint theory
- Semantics-based program analysis for logic-based languages using XSB
- Strategies in combined learning via logic programs
- Tabled evaluation with delaying for general logic programs
- Tabling for non-monotonic programming
- Tabling with answer subsumption: implementation, applications and performance
- The limits of fixed-order computation
- The well-founded semantics for general logic programs
Cited in
(48)- Causal inference in cplint
- Semantics-based program analysis for logic-based languages using XSB
- Tabling for non-monotonic programming
- Learning hierarchical probabilistic logic programs
- Abduction with probabilistic logic programming under the distribution semantics
- The fuzzy logic programming language FASILL: design and implementation
- Why-provenance information for RDF, rules, and negation
- \textsc{Tor}: modular search with hookable disjunction
- XSB
- scientific article; zbMATH DE number 1696815 (Why is no real title available?)
- scientific article; zbMATH DE number 1696855 (Why is no real title available?)
- Tabling, rational terms, and coinduction finally together!
- Incremental Tabling in Support of Knowledge Representation and Reasoning
- Using tabled logic programming to solve the Petrobras planning problem
- Terminating evaluation of logic programs with finite three-valued models
- Pre-indexed Terms for Prolog
- scientific article; zbMATH DE number 1950447 (Why is no real title available?)
- scientific article; zbMATH DE number 1956546 (Why is no real title available?)
- scientific article; zbMATH DE number 1497838 (Why is no real title available?)
- Top-down and bottom-up evaluation procedurally integrated
- Scaling-up reasoning and advanced analytics on BigData
- Table space designs for implicit and explicit concurrent tabled evaluation
- Tabling as a library with delimited control
- Practical run-time checking via unobtrusive property caching
- Predicate logic as a modeling language: modeling and solving some machine learning and data mining problems with IDP3
- Query answering in resource-based answer set semantics
- Tabling with sound answer subsumption
- A linear algebraic approach to Datalog evaluation
- Towards multi-threaded local tabling using a common table space
- Tabling with answer subsumption: implementation, applications and performance
- Description, implementation, and evaluation of a generic design for tabled CLP
- scientific article; zbMATH DE number 7455706 (Why is no real title available?)
- scientific article; zbMATH DE number 7455714 (Why is no real title available?)
- Incremental analysis of logic programs with assertions and open predicates
- About epistemic negation and world views in epistemic logic programs
- Managing caching strategies for stream reasoning with reinforcement learning
- Correctness and completeness of logic programs
- Compiling \(\mathrm{input}^\ast\) FO\((\cdot)\) inductive definitions into tabled prolog rules for IDP3
- A practical analysis of non-termination in large logic programs
- A goal-directed implementation of query answering for hybrid MKNF knowledge bases
- Incremental reasoning on monadic second-order logics with logic programming
- Fifty Years of Prolog and Beyond
- Parallel Logic Programming: A Sequel
- Disjunctive delimited control
- On combining ontologies and rules
- Defeasible reasoning via \(\mathrm{Datalog} {}^\neg\)
- Knowledge authoring for rules and actions
- Semantic-based construction of arguments: an answer set programming approach
This page was built for publication: XSB: extending Prolog with tabled logic programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2893097)
