77 search results - page 5 / 16 » Guarded Fixed Point Logic |
AGP
1993
IEEE
15 years 3 months ago
1993
IEEE
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 ...
102
click to vote
ICLP
2001
Springer
15 years 4 months ago
2001
Springer
We formally characterize alternating fixed points of boolean equation systems as models of (propositional) normal logic programs. To this end, we introduce the notion of a preferr...
BIRTHDAY
1987
Springer
15 years 3 months ago
1987
Springer
78
Voted
IWINAC
2007
Springer
15 years 5 months ago
2007
Springer
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...
107
click to vote
LICS
2010
IEEE
14 years 9 months ago
2010
IEEE
We prove that fixed-point logic with counting captures polynomial time on all classes of graphs with excluded minors. That is, for every class C of graphs such that some graph H is...