XSB: Extending Prolog with Tabled Logic Programming
From MaRDI portal
Publication:2893097
DOI10.1017/S1471068411000500zbMath1244.68021arXiv1012.5123OpenAlexW2165876990WikidataQ56059060 ScholiaQ56059060MaRDI QIDQ2893097
Terrance Swift, David S. Warren
Publication date: 25 June 2012
Published in: Theory and Practice of Logic Programming (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1012.5123
Related Items (37)
Correctness and Completeness of Logic Programs ⋮ 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, Rational Terms, and Coinduction Finally Together! ⋮ Incremental Tabling in Support of Knowledge Representation and Reasoning ⋮ Causal inference in cplint ⋮ Terminating Evaluation of Logic Programs with Finite Three-Valued Models ⋮ Incremental Analysis of Logic Programs with Assertions and Open Predicates ⋮ Pre-indexed Terms for Prolog ⋮ Fifty Years of Prolog and Beyond ⋮ Parallel Logic Programming: A Sequel ⋮ 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 withIDP3 ⋮ Query answering in resource-based answer set semantics ⋮ Tabling with Sound Answer Subsumption ⋮ A linear algebraic approach to datalog evaluation ⋮ Disjunctive delimited control ⋮ About Epistemic Negation and World Views in Epistemic Logic Programs ⋮ Semantic-based construction of arguments: an answer set programming approach ⋮ On combining ontologies and rules ⋮ The fuzzy logic programming language FASILL: design and implementation ⋮ \textsc{Tor}: modular search with hookable disjunction ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Managing caching strategies for stream reasoning with reinforcement learning ⋮ Compiling Input* FO(·) inductive definitions into tabled prolog rules for IDP3 ⋮ A practical analysis of non-termination in large logic programs ⋮ Towards multi-threaded local tabling using a common table space ⋮ A goal-directed implementation of query answering for hybrid MKNF knowledge bases ⋮ Why-provenance information for RDF, rules, and negation ⋮ Incremental reasoning on monadic second-order logics with logic programming ⋮ Description, Implementation, and Evaluation of a Generic Design for Tabled CLP ⋮ XSB ⋮ Learning hierarchical probabilistic logic programs ⋮ Abduction with probabilistic logic programming under the distribution semantics
Uses Software
Cites Work
- Strategies in combined learning via logic programs
- Preference Logic Grammars: Fixed point semantics and application to data standardization
- Extending and implementing the stable model semantics
- Semantics-based program analysis for logic-based languages using XSB
- Tabling for non-monotonic programming
- Logic programs with stable model semantics as a constraint programming paradigm
- Quantitative deduction and its fixpoint theory
- Efficient access mechanisms for tabled logic programs
- The well-founded semantics for general logic programs
- Logical foundations of object-oriented and frame-based languages
- Tabled evaluation with delaying for general logic programs
- Tabling with Answer Subsumption: Implementation, Applications and Performance
- Logic Programming with Defaults and Argumentation Theories
- Concurrent and Local Evaluation of Normal Programs
- The limits of fixed-order computation
This page was built for publication: XSB: Extending Prolog with Tabled Logic Programming
