Tabled Logic Programs: Principles, Practice and Applications
Explore this paper's citation graph
- Type
- article
- Published
- 1996-01-01
- Cited by
- 0
- References
- 115
- Access
- Open access
- OpenAlex
- https://openalex.org/W1954899367
- Semantic Scholar
- https://api.semanticscholar.org/CorpusID:264637867
Keywords
Computer science, Programming language
References
- A Thread in Time Saves Tabling Time
- Optimizing Clause Resolution: Beyond Unification Factoring
- Is There Anything Better than Magic?
- An Abstract Machine for SLG Resolution: Definite Programs
- An Abstract Machine for Computing the Well-Founded Semantics
- Top-Down beats Bottom-Up for Constraint Based Extensions of Datalog
- SLX - A Top-down Derivation Procedure for Programs with Explicit Negation
- A Query Evaluation Method for Stratified Programs Under the Extended CWA
- Extending the Well-Founded and Valid Semantics for Aggregation
- Negations as Hypotheses: An Abductive Foundation for Logic Programming
- Semantics of Logic Programs with Aggregates
- Some Practical Properties of Logic Programming Interpreters
- Representing Actions in Extended Logic Programming
- Deductive Databases with Incomplete Information
- Model-based diagnosis preferences and strategies representation with logic meta-programming
- Dynamic Programming Optimization for Logic Queries with Aggregates
- Controlling the Search in Bottom-Up Evaluation
- Completeness of a Top-Down Query Evaluation Procedure for Stratified Databases
- Efficient evaluation of normal logic programs
- Weakly Perfect Model Semantics for Logic Programs
Cited by
No citing papers recorded for this paper.
Related papers
- Principles, practice, and applications of tabled logic programming
- Eqivalences of Logic Programs
- Sharing Analysis for Logic Programs using Set Logic Programs
- Set-based analysis of logic programs and reactive logic programs (tutorial)
- Types for Logic Programs
- Tabled logic programming for verification and program analysis