Search Results - "Negation in Logic Programming"
-
1
Approximation Fixpoint Theory and the Well-Founded Semantics of Higher-Order Logic Programs
ISSN: 1471-0684, 1475-3081Published: Cambridge, UK Cambridge University Press 01.07.2018Published in Theory and practice of logic programming (01.07.2018)“…We define a novel, extensional, three-valued semantics for higher-order logic programs with negation. The new semantics is based on interpreting the types of…”
Get full text
Journal Article -
2
The intricacies of three-valued extensional semantics for higher-order logic programs
ISSN: 1471-0684, 1475-3081Published: Cambridge, UK Cambridge University Press 01.09.2017Published in Theory and practice of logic programming (01.09.2017)“…M. Bezem defined an extensional semantics for positive higher-order logic programs. Recently, it was demonstrated by Rondogiannis and Symeonidou that Bezem's…”
Get full text
Journal Article -
3
The infinite-valued semantics: overview, recent results and future directions
ISSN: 1166-3081, 1958-5780Published: Abingdon Routledge 01.06.2013Published in Journal of applied non-classical logics (01.06.2013)“…The infinite-valued semantics was introduced in Rondogiannis and Wadge (2005) as a purely logical way for capturing the meaning of well-founded negation in…”
Get full text
Journal Article -
4
An infinite-game semantics for well-founded negation in logic programming
ISSN: 0168-0072Published: Elsevier B.V 01.02.2008Published in Annals of pure and applied logic (01.02.2008)“…We present an infinite-game characterization of the well-founded semantics for function-free logic programs with negation. Our game is a simple generalization…”
Get full text
Journal Article -
5
Strong equivalence of logic programs under the infinite-valued semantics
ISSN: 0020-0190, 1872-6119Published: Amsterdam Elsevier B.V 16.05.2009Published in Information processing letters (16.05.2009)“…We consider the notion of strong equivalence [V. Lifschitz, D. Pearce, A. Valverde, Strongly equivalent logic programs, ACM Transactions on Computational Logic…”
Get full text
Journal Article -
6
Proving correctness and completeness of normal programs – a declarative approach
ISSN: 1471-0684, 1475-3081, 1475-3081Published: Cambridge, UK Cambridge University Press 01.11.2005Published in Theory and practice of logic programming (01.11.2005)“…We advocate a declarative approach to proving properties of logic programs. Total correctness can be separated into correctness, completeness and clean…”
Get full text
Journal Article -
7
Logic programming with default, weak and strict negations
ISSN: 1471-0684, 1475-3081Published: Cambridge, UK Cambridge University Press 01.11.2006Published in Theory and practice of logic programming (01.11.2006)“…This paper looks at logic programming with three kinds of negation: default, weak and strict negations. A 3-valued logic model theory is discussed for logic…”
Get full text
Journal Article -
8
Logic programming with default, weak and strict negations
ISSN: 1471-0684, 1475-3081Published: Cambridge University Press (CUP) 16.10.2006Published in Theory and Practice of Logic Programming (16.10.2006)Get full text
Journal Article