The following pages link to XSB (Q25788):
Displaying 50 items.
- Logic programming approach to automata-based decision procedures (Q347398) (← links)
- A framework for modular ERDF ontologies (Q360258) (← links)
- Enhancing global SLS-resolution with loop cutting and tabling mechanisms (Q703484) (← links)
- Two case studies of semantics execution in Maude: CCS and LOTOS (Q816216) (← links)
- Semantic-based construction of arguments: an answer set programming approach (Q899190) (← links)
- Information flow in tabular interpretations for generalized push-down automata (Q1129130) (← links)
- Memoing evaluation for constraint extensions of datalog (Q1378383) (← links)
- Constrained dependencies (Q1391931) (← links)
- Parallelism and implementation technology for (constraint) logic programming. Workshop in conjunction with ICLP '99, Las Cruces, NM, USA, December 1, 1999 (Q1574967) (← links)
- Preference Logic Grammars: Fixed point semantics and application to data standardization (Q1603737) (← links)
- Causal inference in cplint (Q1679666) (← links)
- Dynamic reordering of alternatives for definite logic programs (Q1749236) (← links)
- Semantics-based program analysis for logic-based languages using XSB (Q1856181) (← links)
- Algorithmic power from declarative use of redundant constraints (Q1969732) (← links)
- Tabling for non-monotonic programming (Q1978007) (← links)
- Learning hierarchical probabilistic logic programs (Q2071314) (← links)
- Abduction with probabilistic logic programming under the distribution semantics (Q2076968) (← links)
- Why-provenance information for RDF, rules, and negation (Q2248547) (← links)
- Efficient and flexible access control via Jones-optimal logic program specialisation (Q2271897) (← links)
- Using clausal deductive databases for defining semantics in disjunctive deductive databases (Q2349825) (← links)
- A three-valued semantics for querying and repairing inconsistent databases (Q2426103) (← links)
- \textsc{Tor}: modular search with hookable disjunction (Q2441515) (← links)
- (Q2723916) (← links)
- (Q2751371) (← links)
- (Q2767081) (← links)
- (Q2767090) (← links)
- (Q2767119) (← links)
- (Q2767130) (← links)
- (Q2767132) (← links)
- (Q2773771) (← links)
- Interdefinability of defeasible logic and logic programming under the well-founded semantics (Q2845124) (← links)
- Program Updating by Incremental and Answer Subsumption Tabling (Q2851278) (← links)
- Incremental Tabling for Query-Driven Propagation of Logic Program Updates (Q2870163) (← links)
- Implementation Alternatives for Bottom-Up Evaluation (Q2883072) (← links)
- Tabling and answer subsumption for reasoning on logic programs with annotated disjunctions (Q2883089) (← links)
- Tabling, Rational Terms, and Coinduction Finally Together! (Q2931251) (← links)
- Incremental Tabling in Support of Knowledge Representation and Reasoning (Q2931264) (← links)
- Infinite probability computation by cyclic explanation graphs (Q2933089) (← links)
- MWeb (Q2946635) (← links)
- A Generalized QSQR Evaluation Method for Horn Knowledge Bases (Q2946681) (← links)
- Terminating Evaluation of Logic Programs with Finite Three-Valued Models (Q2946744) (← links)
- Inspecting Side-Effects of Abduction in Logic Programs (Q3001918) (← links)
- Pushing Efficient Evaluation of HEX Programs by Modular Decomposition (Q3003246) (← links)
- (Q3007257) (← links)
- The PITA system: Tabling and answer subsumption for reasoning under uncertainty (Q3087434) (← links)
- (Q3112638) (← links)
- Efficient top-down computation of queries under the well-founded semantics (Q3125898) (← links)
- Minimal and consistent evolution of knowledge bases (Q3128368) (← links)
- On the decidability and axiomatization of query finiteness in deductive databases (Q3158516) (← links)
- Semantics of static pointcuts in aspectJ (Q3189782) (← links)
