393 search results - page 39 / 79 » Logic Programs with Classical Negation |
120
click to vote
PLPV
2012
ACM
13 years 5 months ago
2012
ACM
Functional Reactive Programming (FRP) is a form of reactive programming whose model is pure functions over signals. FRP is often expressed in terms of arrows with loops, which is ...
AAAI
2008
15 years 2 days ago
2008
In several applications of logic programming and Transaction Logic, such as, planning, trust management and independent Semantic Web Services, an action might produce incomplete f...
PPDP
2004
Springer
15 years 3 months ago
2004
Springer
We introduce just enough tabling (JET), a mechanism to suspend and resume the tabled execution of logic programs at an arbitrary point. In particular, JET allows pruning of tabled...
LOPSTR
2005
Springer
15 years 3 months ago
2005
Springer
Partial evaluation of logic programs which contain impure predicates poses non-trivial challenges. Impure predicates include those which produce side-effects, raise errors (or exc...
114
click to vote
IFIP
2001
Springer
15 years 2 months ago
2001
Springer
— Semi-formal verification based on symbolic simulation offers a good compromise between formal model checking and numerical simulation. The generation of functional test vector...