A Logical Foundation for Logic Programming II: Semantics of General Logic Programs
نویسنده
چکیده
We suggested in 12] a general logical formalism for Logic Programming based on a four-valued inference. In this paper we give a uniform representation of various semantics for logic programs based on this formalism. The main conclusion from this representation is that the distinction between these semantics can be largely attributed to the diierence in their underlying (monotonic) logical systems. Moreover, in most cases the diierence can even be reduced to that of the language , that is, to the diierence in the logical connectives allowed for representing derivable information.
منابع مشابه
A Logical Foundation for Logic Programming I: Biconsequence Relations and Nonmonotonic Completion
We suggest a general logical formalism for Logic Programming based on a four-valued inference. We show that it forms a proper setting for representing logic programs with negation as failure of a most general kind and for describing logics and semantics that characterize their behavior. In this way we also extend the connection between Logic and Logic Programming beyond positive programs. In ad...
متن کاملAbstractions in Logic Programs
ions in Logic Programs Dale Miller University of Pennsylvania Follow this and additional works at: http://repository.upenn.edu/cis_reports University of Pennsylvania Department of Computer and Information Science Technical Report No. MS-CIS-89-30. This paper is posted at ScholarlyCommons. http://repository.upenn.edu/cis_reports/702 For more information, please contact [email protected]...
متن کاملParametrized Equilibrium Logic
Equilibrium logic provides a logical foundation for the stable model approach to the 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. Stab...
متن کاملar X iv : 0 90 6 . 45 86 v 1 [ qu an t - ph ] 2 5 Ju n 20 09 Hoare Logic for Quantum Programs ∗
Hoare logic is a foundation of axiomatic semantics of classical programs and it provides effective proof techniques for reasoning about correctness of classical programs. To offer similar techniques for quantum program verification and to build a logical foundation of programming methodology for quantum computers, we develop a full-fledged Hoare logic for both partial and total correctness of q...
متن کاملAnalysing and Extending Well-Founded and Partial Stable Semantics Using Partial Equilibrium Logic
In [4] a nonmonotonic formalism called partial equilibrium logic (PEL) was proposed as a logical foundation for the well-founded semantics (WFS) of logic programs. PEL consists in de ning a class of minimal models, called partial equilibrium (p-equilibrium), inside a non-classical logic called HT 2. In [4] it was shown that, on normal logic programs, p-equilibrium models coincide with Przymusin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Log. Program.
دوره 35 شماره
صفحات -
تاریخ انتشار 1998