Pages that link to "Item:Q4371515"
From MaRDI portal
The following pages link to Tabled evaluation with delaying for general logic programs (Q4371515):
Displayed 38 items.
- Local closed world reasoning with description logics under the well-founded semantics (Q646502) (← 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)
- Tabulation proof procedures for fuzzy linguistic logic programming (Q899133) (← links)
- Dynamic reordering of alternatives for definite logic programs (Q1749236) (← links)
- Abduction with probabilistic logic programming under the distribution semantics (Q2076968) (← links)
- Why-provenance information for RDF, rules, and negation (Q2248547) (← links)
- Precise specification matching for adaptive reuse in embedded systems (Q2372190) (← links)
- Logic programming with solution preferences (Q2378282) (← links)
- Representation sharing for Prolog (Q2845123) (← links)
- XSB: Extending Prolog with Tabled Logic Programming (Q2893097) (← links)
- The language features and architecture of B-Prolog (Q2893099) (← links)
- An overview of Ciao and its design philosophy (Q2893101) (← links)
- Tabling, Rational Terms, and Coinduction Finally Together! (Q2931251) (← links)
- Incremental Tabling in Support of Knowledge Representation and Reasoning (Q2931264) (← links)
- Terminating Evaluation of Logic Programs with Finite Three-Valued Models (Q2946744) (← links)
- Program Specialization for Verifying Infinite State Systems: An Experimental Evaluation (Q3003492) (← links)
- Parallel backtracking with answer memoing for independent and-parallelism (Q3087444) (← links)
- Normative Systems Represented as Hybrid Knowledge Bases (Q3092311) (← links)
- Swapping evaluation: A memory-scalable solution for answer-on-demand tabling (Q3585156) (← links)
- Termination prediction for general logic programs (Q3648357) (← links)
- Table space designs for implicit and explicit concurrent tabled evaluation (Q4559837) (← links)
- Tabling as a library with delimited control (Q4592987) (← links)
- An abstract machine for fixed-order dynamically stratified programs (Q4647532) (← links)
- Towards multi-threaded local tabling using a common table space (Q4911126) (← links)
- Efficient tabling of structured data with enhanced hash-consing (Q4911133) (← links)
- Description, Implementation, and Evaluation of a Generic Design for Tabled CLP (Q4957184) (← links)
- (Q5020560) (← links)
- Well–definedness and efficient inference for probabilistic logic programming under the distribution semantics (Q5299588) (← links)
- A goal-directed implementation of query answering for hybrid MKNF knowledge bases (Q5410731) (← links)
- Concurrent and Local Evaluation of Normal Programs (Q5504657) (← links)
- Generating Specialized Rules and Programs for Demand-Driven Analysis (Q5505434) (← links)
- The limits of fixed-order computation (Q5940930) (← links)
- \(\mho\)-resolution and hybrid knowledge bases (Q5947353) (← links)
- Loop checks for logic programs with functions (Q5958765) (← links)
- A sound and complete procedure for a general logic program in non-floundering derivations with respect to the 3-valued stable model semantics (Q5958767) (← links)
- Parallel Logic Programming: A Sequel (Q6063892) (← links)
- On combining ontologies and rules (Q6166577) (← links)