Bilattices and the semantics of logic programming
Journal of Logic Programming
The well-founded semantics for general logic programs
Journal of the ACM (JACM)
The alternating fixpoint of logic programs with negation
PODS '89 Selected papers of the eighth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Minimal belief and negation as failure
Artificial Intelligence
Strongly equivalent logic programs
ACM Transactions on Computational Logic (TOCL) - Special issue devoted to Robert A. Kowalski
WADT '98 Selected papers from the 13th International Workshop on Recent Trends in Algebraic Development Techniques
LPNMR '01 Proceedings of the 6th International Conference on Logic Programming and Nonmonotonic Reasoning
Description logic programs: combining logic programs with description logic
WWW '03 Proceedings of the 12th international conference on World Wide Web
Annals of Mathematics and Artificial Intelligence
ELP: Tractable Rules for OWL 2
ISWC '08 Proceedings of the 7th International Conference on The Semantic Web
A faithful integration of description logics with logic programming
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Annals of Mathematics and Artificial Intelligence
Parametrized equilibrium logic
LPNMR'11 Proceedings of the 11th international conference on Logic programming and nonmonotonic reasoning
Specifying and reasoning about normative systems in deontic logic programming
Proceedings of the 11th International Conference on Autonomous Agents and Multiagent Systems - Volume 3
An embedding of input-output logic in deontic logic programs
DEON'12 Proceedings of the 11th international conference on Deontic Logic in Computer Science
| Hi-index | 0.00 |
Traditionally, a logic program is built up to reason about atomic first-order formulas. The key idea of parametrized logic programming is that, instead of atomic first-order formulas, a parametrized logic program reasons about formulas of a given parameter logic. Of course, the main challenge is to define the semantics of such general programs. In this work we introduce the novel definitions along with some motivating examples. This approach allows us to prove general results that can be instantiated for every particular choice of the parameter logic. Important general results we can prove include the existence of semantics and the alternating fix-point theorem of well-founded semantics. To reenforce the soundness of our general framework we show that some known approaches in the literature of logic programming, such as paraconsistent answer-sets and the MKNF semantics for hybrid knowledge bases, are obtained as particular choices of the parameter logic.