Tabling for non-monotonic programming
From MaRDI portal
Publication:1978007
DOI10.1023/A:1018990308362zbMATH Open0940.68025OpenAlexW1520935955WikidataQ56059058 ScholiaQ56059058MaRDI QIDQ1978007FDOQ1978007
Authors: Terrance Swift 
Publication date: 7 June 2000
Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1018990308362
Recommendations
Logic programming (68N17) Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19)
Cited In (14)
- PRISM revisited: declarative implementation of a probabilistic programming language using multi-prompt delimited control
- A Framework for Goal-Directed Query Evaluation with Negation
- 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
- Title not available (Why is that?)
- Tabulation proof procedures for fuzzy linguistic logic programming
- Well–definedness and efficient inference for probabilistic logic programming under the distribution semantics
- Title not available (Why is that?)
- 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
- Tabling with Sound Answer Subsumption
Uses Software
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)
