XSB
From MaRDI portal
Software:25788
swMATH13877MaRDI QIDQ25788FDOQ25788
Author name not available (Why is that?)
Cited In (only showing first 100 items - show all)
- On the complexity analysis of static analyses
- Title not available (Why is that?)
- Infinite probability computation by cyclic explanation graphs
- Terminating Evaluation of Logic Programs with Finite Three-Valued Models
- Abduction in well-founded semantics and generalized stable models via tabled dual programs
- Title not available (Why is that?)
- Preference Logic Grammars: Fixed point semantics and application to data standardization
- Two case studies of semantics execution in Maude: CCS and LOTOS
- Title not available (Why is that?)
- Title not available (Why is that?)
- The limits of fixed-order computation
- Title not available (Why is that?)
- Title not available (Why is that?)
- Database Support for Data Mining Applications
- Experimenting with recursive queries in database and logic programming systems
- About Epistemic Negation and World Views in Epistemic Logic Programs
- Enhancing global SLS-resolution with loop cutting and tabling mechanisms
- The PITA system: Tabling and answer subsumption for reasoning under uncertainty
- Nonmonotonic reasoning: Towards efficient calculi and implementations
- Dynamic reordering of alternatives for definite logic programs
- An abstract machine for efficiently computing queries to well-founded models
- Why-provenance information for RDF, rules, and negation
- Information flow in tabular interpretations for generalized push-down automata
- On the decidability and axiomatization of query finiteness in deductive databases
- Model checking with probabilistic tabled logic programming
- Reasoning about ER models in a deductive environment
- Constrained dependencies
- Logic Programming Approach to Automata-Based Decision Procedures
- Title not available (Why is that?)
- Title not available (Why is that?)
- Algorithmic power from declarative use of redundant constraints
- Tabling for non-monotonic programming
- Title not available (Why is that?)
- Title not available (Why is that?)
- On applying or-parallelism and tabling to logic programs
- Predicate logic as a modeling language: modeling and solving some machine learning and data mining problems withIDP3
- Tabled evaluation with delaying for general logic programs
- Tabling with Answer Subsumption: Implementation, Applications and Performance
- Programming Languages and Systems
- Title not available (Why is that?)
- Title not available (Why is that?)
- Verification, Model Checking, and Abstract Interpretation
- Semantic-based construction of arguments: an answer set programming approach
- Well–definedness and efficient inference for probabilistic logic programming under the distribution semantics
- Using clausal deductive databases for defining semantics in disjunctive deductive databases
- Tabling as a library with delimited control
- Deductive Spreadsheets Using Tabled Logic Programming
- Practical run-time checking via unobtrusive property caching
- Pushing Efficient Evaluation of HEX Programs by Modular Decomposition
- Title not available (Why is that?)
- Logic programming approach to automata-based decision procedures
- Logic Programming and Nonmonotonic Reasoning
- Title not available (Why is that?)
- MWeb
- Efficient top-down computation of queries under the well-founded semantics
- Incremental Analysis of Logic Programs with Assertions and Open Predicates
- A framework for modular ERDF ontologies
- Title not available (Why is that?)
- Learning hierarchical probabilistic logic programs
- Scaling-up reasoning and advanced analytics on BigData
- Correctness and Completeness of Logic Programs
- A linear algebraic approach to datalog evaluation
- Title not available (Why is that?)
- Efficient and flexible access control via Jones-optimal logic program specialisation
- Abduction with probabilistic logic programming under the distribution semantics
- A three-valued semantics for querying and repairing inconsistent databases
- Causal inference in cplint
- Tabling and answer subsumption for reasoning on logic programs with annotated disjunctions
- Parallelism and implementation technology for (constraint) logic programming. Workshop in conjunction with ICLP '99, Las Cruces, NM, USA, December 1, 1999
- Title not available (Why is that?)
- Title not available (Why is that?)
- Linear tabulated resolution based on Prolog control strategy
- Transformation-based bottom-up computation of the well-founded model
- Logic Programming
- Memoing evaluation for constraint extensions of datalog
- Using methods of declarative logic programming for intelligent information agents
- Semantics-based program analysis for logic-based languages using XSB
- Title not available (Why is that?)
- Constructive negation under the well-founded semantics
- Implementation alternatives for bottom-up evaluation
- Logic Programming
- Euro-Par 2004 Parallel Processing
- A Gradual Polymorphic Type System with Subtyping for Prolog
- \textsc{Tor}: modular search with hookable disjunction
- Title not available (Why is that?)
- Efficient access mechanisms for tabled logic programs
- Compiling Input* FO(·) inductive definitions into tabled prolog rules for IDP3
- Logic Programming
- Title not available (Why is that?)
- Logic Programming
- Title not available (Why is that?)
- Adding Evolving Abilities to a Multi-Agent System
- Top-down and Bottom-up Evaluation Procedurally Integrated
- Optimizing Fixpoint Evaluation of Logic Programs with Uncertainty
- Tabling, Rational Terms, and Coinduction Finally Together!
- An abstract machine for fixed-order dynamically stratified programs
- Managing caching strategies for stream reasoning with reinforcement learning
- Title not available (Why is that?)
- Journal on Data Semantics II
- Loop checks for logic programs with functions
This page was built for software: XSB