Lindenbaum-algebraic semantics of logic programs

2005 ◽  
pp. 80-91
Author(s):  
Gerd Wagner
Keyword(s):  
Algebraic Semantics ◽  
Logic Programs ◽  
Semantics Of Logic Programs

TOPOLOGY AND THE SEMANTICS OF LOGIC PROGRAMS

1995 ◽  
Vol 24 (4) ◽  
pp. 359-386 ◽  
Author(s):  
Anthony Karel Seda
Keyword(s):  
Logic Programs ◽  
Semantics Of Logic Programs

scholarly journals Well-founded and stable semantics of logic programs with aggregates

2007 ◽  
Vol 7 (3) ◽  
pp. 301-353 ◽  
Author(s):  
NIKOLAY PELOV ◽  
MARC DENECKER ◽  
MAURICE BRUYNOOGHE
Keyword(s):  
Logic Programming ◽  
Second Order ◽  
Logic Programs ◽  
Consequence Operator ◽  
Trade Offs ◽  
Stable Semantics ◽  
Consequence Operators ◽  
Semantics Of Logic Programs ◽  
Stable Models

AbstractIn this paper, we present a framework for the semantics and the computation of aggregates in the context of logic programming. In our study, an aggregate can be an arbitrary interpreted second order predicate or function. We define extensions of the Kripke-Kleene, the well-founded and the stable semantics for aggregate programs. The semantics is based on the concept of a three-valuedimmediate consequence operatorof an aggregate program. Such an operatorapproximatesthe standard two-valued immediate consequence operator of the program, and induces a unique Kripke-Kleene model, a unique well-founded model and a collection of stable models. We study different ways of defining such operators and thus obtain a framework of semantics, offering different trade-offs betweenprecisionandtractability. In particular, we investigate conditions on the operator that guarantee that the computation of the three types of semantics remains on the same level as for logic programs without aggregates. Other results show that, in practice, even efficient three-valued immediate consequence operators which are very low in the precision hierarchy, still provide optimal precision.

scholarly journals A Model-Theoretic Reconstruction of the Operational Semantics of Logic Programs

1993 ◽  
Vol 103 (1) ◽  
pp. 86-113 ◽  
Author(s):  
M. Falaschi ◽  
G. Levi ◽  
M. Martelli ◽  
C. Palamidessi
Keyword(s):  
Operational Semantics ◽  
Logic Programs ◽  
Semantics Of Logic Programs

scholarly journals Safe Inductions: An Algebraic Study

2017 ◽  
Author(s):  
Bart Bogaerts ◽  
Joost Vennekens ◽  
Marc Denecker
Keyword(s):  
Knowledge Representation ◽  
Logic Programming ◽  
Logic Programs ◽  
Intended Meaning ◽  
Safety Criterion ◽  
Autoepistemic Logic ◽  
Semantics Of Logic Programs ◽  
Do So

In many knowledge representation formalisms, a constructive semantics is defined based on sequential applications of rules or of a semantic operator. These constructions often share the property that rule applications must be delayed until it is safe to do so: until it is known that the condition that triggers the rule will remain to hold. This intuition occurs for instance in the well-founded semantics of logic programs and in autoepistemic logic. In this paper, we formally define the safety criterion algebraically. We study properties of so-called safe inductions and apply our theory to logic programming and autoepistemic logic. For the latter, we show that safe inductions manage to capture the intended meaning of a class of theories on which all classical constructive semantics fail.

scholarly journals On the Semantics of Logic Programs with Preferences

2006 ◽  
pp. 203-215 ◽  
Author(s):  
Sergio Greco ◽  
Irina Trubitsyna ◽  
Ester Zumpano
Keyword(s):  
Logic Programs ◽  
Semantics Of Logic Programs
Sign in / Sign up

Export Citation Format

Share Document