Theorems on pre-fixed points of non-monotonic functions with applications in logic programming and formal grammars

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

Abstract

We derive two novel theorems regarding pre-fixed points of non-monotonic functions and demonstrate that they have immediate applications in logic programming and formal grammars. In particular, the results of the paper lead to a natural generalization of the model intersection theorem for definite logic programs, to the more general class of normal logic programs. Moreover, the obtained results also offer the first (to our knowledge) model intersection result for Boolean grammars. © 2014 Springer-Verlag.

Cite

CITATION STYLE

APA

Ésik, Z., & Rondogiannis, P. (2014). Theorems on pre-fixed points of non-monotonic functions with applications in logic programming and formal grammars. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8652 LNCS, pp. 166–180). Springer Verlag. https://doi.org/10.1007/978-3-662-44145-9_12

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