On the relationship between TMS and logic programs
From MaRDI portal
In the present paper the relationship between truth maintenance systems (TMSs) and general logic programs is studied. For every TMS theory \(J\) a general logic program \(GIp(J)\) is effectively constructed such that a set \(E\) of propositional statements is an extension of \(J\) if and only if \(E\) is a stable model of \(GIp(J)\).
Recommendations
- scientific article; zbMATH DE number 1407682
- scientific article; zbMATH DE number 67479
- Publication:5750424
- scientific article; zbMATH DE number 910717
- Relating logic programs via program maps
- Logic programs and connectionist networks
- Some relationships between logics of programs and complexity theory
- The relation between logic programming and logic specification
- scientific article; zbMATH DE number 176721
- Publication:3476794
Cites work
- A logic for default reasoning
- scientific article; zbMATH DE number 43398 (Why is no real title available?)
- scientific article; zbMATH DE number 67479 (Why is no real title available?)
- scientific article; zbMATH DE number 4185060 (Why is no real title available?)
- The Semantics of Predicate Logic as a Programming Language
This page was built for publication: On the relationship between TMS and logic programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1333372)