Sciweavers

12 search results - page 1 / 3
» A Note on Logic Programming Fixed-Point Semantics
Sort
View
AGP
1993
IEEE
13 years 8 months ago
A Note on Logic Programming Fixed-Point Semantics
In this paper, we present an account of classical Logic Programming fixed-point semantics in terms of two standard categorical constructions in which the least Herbrand model is ...
Vladimiro Sassone
IWINAC
2007
Springer
13 years 10 months ago
Morphisms of ANN and the Computation of Least Fixed Points of Semantic Operators
We consider a notion of morphism of neural networks and develop its properties. We show how, given any definite logic program P, the least fixed point of the immediate consequenc...
Anthony Karel Seda
ICLP
2009
Springer
14 years 4 months ago
Logic Programs under Three-Valued Lukasiewicz Semantics
If logic programs are interpreted over a three-valued logic, then often Kleene's strong three-valued logic with complete equivalence and Fitting's associated immediate co...
Carroline Dewi Puspa Kencana Ramli, Steffen Hö...
FOIKS
2006
Springer
13 years 8 months ago
Guarded Open Answer Set Programming with Generalized Literals
Abstract. We extend the open answer set semantics for programs with generalized literals. Such extended programs (EPs) have interesting properties, e.g. the ability to express infi...
Stijn Heymans, Davy Van Nieuwenborgh, Dirk Vermeir
CADE
2007
Springer
14 years 4 months ago
Inferring Invariants by Symbolic Execution
In this paper we propose a method for inferring invariants for loops in Java programs. An example of a simple while loop is used throughout the paper to explain our approach. The m...
Benjamin Weiß, Peter H. Schmitt