XSB
From MaRDI portal
Software:25788
No author found.
Related Items (only showing first 100 items - show all)
On the decidability and axiomatization of query finiteness in deductive databases ⋮ On the complexity analysis of static analyses ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Semantics of static pointcuts in aspectJ ⋮ Abduction in well-founded semantics and generalized stable models via tabled dual 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 ⋮ Logic programming approach to automata-based decision procedures ⋮ A framework for modular ERDF ontologies ⋮ Unnamed Item ⋮ Tabling, Rational Terms, and Coinduction Finally Together! ⋮ Incremental Tabling in Support of Knowledge Representation and Reasoning ⋮ Infinite probability computation by cyclic explanation graphs ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Memoing evaluation for constraint extensions of datalog ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Information flow in tabular interpretations for generalized push-down automata ⋮ Causal inference in cplint ⋮ A Generalized QSQR Evaluation Method for Horn Knowledge Bases ⋮ Terminating Evaluation of Logic Programs with Finite Three-Valued Models ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Constrained dependencies ⋮ 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 ⋮ Unnamed Item ⋮ Semantic-based construction of arguments: an answer set programming approach ⋮ A three-valued semantics for querying and repairing inconsistent databases ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Reasoning about ER models in a deductive environment ⋮ \textsc{Tor}: modular search with hookable disjunction ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Algorithmic power from declarative use of redundant constraints ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Inspecting Side-Effects of Abduction in Logic Programs ⋮ Tabling for non-monotonic programming ⋮ Pushing Efficient Evaluation of HEX Programs by Modular Decomposition ⋮ Unnamed Item ⋮ Tabled evaluation with delaying for general logic programs ⋮ Unnamed Item ⋮ Unnamed Item ⋮ An abstract machine for fixed-order dynamically stratified programs ⋮ Dynamic reordering of alternatives for definite logic programs ⋮ Towards multi-threaded local tabling using a common table space ⋮ Efficient tabling of structured data with enhanced hash-consing ⋮ Model checking with probabilistic tabled logic programming ⋮ Why-provenance information for RDF, rules, and negation ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Swapping evaluation: A memory-scalable solution for answer-on-demand tabling ⋮ Enhancing global SLS-resolution with loop cutting and tabling mechanisms ⋮ On applying or-parallelism and tabling to logic programs ⋮ Efficient and flexible access control via Jones-optimal logic program specialisation ⋮ Logic Programming Approach to Automata-Based Decision Procedures ⋮ Optimizing Fixpoint Evaluation of Logic Programs with Uncertainty ⋮ Using methods of declarative logic programming for intelligent information agents ⋮ Linear tabulated resolution based on Prolog control strategy ⋮ Transformation-based bottom-up computation of the well-founded model ⋮ The PITA system: Tabling and answer subsumption for reasoning under uncertainty ⋮ Constructive negation under the well-founded semantics ⋮ Implementation Alternatives for Bottom-Up Evaluation ⋮ Learning hierarchical probabilistic logic programs ⋮ Tabling and answer subsumption for reasoning on logic programs with annotated disjunctions ⋮ Abduction with probabilistic logic programming under the distribution semantics ⋮ Parallelism and implementation technology for (constraint) logic programming. Workshop in conjunction with ICLP '99, Las Cruces, NM, USA, December 1, 1999 ⋮ Interdefinability of defeasible logic and logic programming under the well-founded semantics ⋮ Program Updating by Incremental and Answer Subsumption Tabling ⋮ Efficient top-down computation of queries under the well-founded semantics ⋮ Efficient access mechanisms for tabled logic programs ⋮ Minimal and consistent evolution of knowledge bases ⋮ MWeb ⋮ Semantics-based program analysis for logic-based languages using XSB ⋮ An abstract machine for efficiently computing queries to well-founded models ⋮ Incremental Tabling for Query-Driven Propagation of Logic Program Updates ⋮ Using clausal deductive databases for defining semantics in disjunctive deductive databases ⋮ Preference Logic Grammars: Fixed point semantics and application to data standardization ⋮ Two case studies of semantics execution in Maude: CCS and LOTOS
This page was built for software: XSB
