Sciweavers

1278 search results - page 75 / 256
» On the Semantics of Logic Program Composition
Sort
View
LISP
2007
124views more  LISP 2007»
13 years 7 months ago
A new generic scheme for functional logic programming with constraints
In this paper we propose a new generic scheme CFLP(D ), intended as a logical and semantic framework for lazy Constraint Functional Logic Programming over a parametrically given co...
Francisco Javier López-Fraguas, Mario Rodr&...
AGP
1996
IEEE
13 years 12 months ago
Modular Analysis of Suspension Free cc Programs
Compositional semantics allow to reason about programs in an incremental way, thus providing the formal base for the development of modular data-flow analyses. The major drawback ...
Enea Zaffanella
IWINAC
2007
Springer
14 years 1 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
FSEN
2009
Springer
14 years 2 months ago
Program Logics for Sequential Higher-Order Control
We introduce a Hoare logic for higher-order functional languages with control operators such as callcc. The key idea is to build the assertion language and proof rules around an e...
Martin Berger
AGP
2003
IEEE
14 years 1 months ago
Transforming co-NP Checks to Answer Set Computation by Meta-Interpretation
Many NP-complete problems can be encoded in the answer set semantics of logic programs in a very concise way, where the encoding reflects the typical “guess and check” nature ...
Thomas Eiter, Axel Polleres