Parametrized equilibrium logic

2Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Equilibrium logic provides a logical foundation for the stable model semantics of logic programs. Recently, parametrized logic programming was introduced with the aim of presenting the syntax and natural semantics for parametrized logic programs, which are very expressive logic programs, in the sense that complex formulas are allowed to appear in the body and head of rules. Stable model semantics was defined for such parametrized logic programs. The aim of this paper is to introduce a parametrized version of equilibrium logic that extends parametrized logic programs to general theories, and to show how these can be used to characterize and to study strong equivalence of temporal logic programs. © 2011 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Gonçalves, R., & Alferes, J. J. (2011). Parametrized equilibrium logic. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6645 LNAI, pp. 236–241). https://doi.org/10.1007/978-3-642-20895-9_25

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free