Logic programs with classical negation
Logic programming
The well-founded semantics for general logic programs
Journal of the ACM (JACM)
Theory of generalized annotated logic programming and its applications
Journal of Logic Programming
A logic for reasoning with inconsistency
Journal of Automated Reasoning
ACM Transactions on Database Systems (TODS)
The Semantics of Predicate Logic as a Programming Language
Journal of the ACM (JACM)
A survey of paraconsistent semantics for logic programs
Handbook of defeasible reasoning and uncertainty management systems
Reasoning with Logic Programming
Reasoning with Logic Programming
XSB: A System for Effciently Computing WFS
LPNMR '97 Proceedings of the 4th International Conference on Logic Programming and Nonmonotonic Reasoning
Composite Distributive Lattices as Annotation Domains for Mediators
AISC '00 Revised Papers from the International Conference on Artificial Intelligence and Symbolic Computation
Extended Fuzzy Logic Programs with Fuzzy Answer Set Semantics
SUM '09 Proceedings of the 3rd International Conference on Scalable Uncertainty Management
Hybrid probabilistic logic programs with non-monotonic negation
ICLP'05 Proceedings of the 21st international conference on Logic Programming
Incomplete knowledge in hybrid probabilistic logic programs
JELIA'06 Proceedings of the 10th European conference on Logics in Artificial Intelligence
Focused most probable world computations in probabilistic logic programs
Annals of Mathematics and Artificial Intelligence
Using Generalized Annotated Programs to Solve Social Network Diffusion Optimization Problems
ACM Transactions on Computational Logic (TOCL)
| Hi-index | 0.00 |
Extended logic programs and annotated logic programs are two important extensions of normal logic programs that allow for a more concise and declarative representation of knowledge. Extended logic programs add explicit negation to the default negation of normal programs in order to distinguish what can be shown to be false from what cannot be proven true. Annotated logic programs generalize the set of truth values over which a program is interpreted by explicitly annotating atoms with elements of a new domain of truth values. In this paper coherent well-founded annotated programs are defined, and shown to generalize both consistent and paraconsistent extended programs, along with several classes of annotated programs.