Tabling for non-monotonic programming
From MaRDI portal
Publication:1978007
Recommendations
Cited in
(14)- PRISM revisited: declarative implementation of a probabilistic programming language using multi-prompt delimited control
- Preference Logic Grammars: Fixed point semantics and application to data standardization
- XSB: extending Prolog with tabled logic programming
- Enhancing global SLS-resolution with loop cutting and tabling mechanisms
- An improved reductant calculus using fuzzy partial evaluation techniques
- Tabling with sound answer subsumption
- scientific article; zbMATH DE number 7455714 (Why is no real title available?)
- Tabulation proof procedures for fuzzy linguistic logic programming
- Well–definedness and efficient inference for probabilistic logic programming under the distribution semantics
- scientific article; zbMATH DE number 1696815 (Why is no real title available?)
- A framework for goal-directed query evaluation with negation
- Termination of logic programs with imperfect information: applications and query procedure
- Auto-tabling for subproblem presolving in MiniZinc
- The PITA system: tabling and answer subsumption for reasoning under uncertainty
This page was built for publication: Tabling for non-monotonic programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1978007)