740 search results - page 81 / 148 » Open Answer Set Programming with Guarded Programs |
POPL
2004
ACM
14 years 8 months ago
2004
ACM
We define seal, an untyped call-by-value -calculus with primitives for protecting abstract data by sealing, and develop a bisimulation proof method that is sound and complete with...
RTCSA
2009
IEEE
14 years 2 months ago
2009
IEEE
The question whether preemptive systems are better than non-preemptive systems has been debated for a long time, but only partial answers have been provided in the real-time liter...
CORR
2010
Springer
13 years 8 months ago
2010
Springer
Modern solvers for Boolean Satisfiability (SAT) and Answer Set Programming (ASP) are based on sophisticated Boolean constraint solving techniques. In both areas, conflict-driven l...
FROCOS
2009
Springer
14 years 2 months ago
2009
Springer
The developments in information technology during the last decade have been rapidly changing the possibilities for data and knowledge access. To respect this, several declarative k...
ASP
2001
Springer
14 years 16 days ago
2001
Springer
Being able to declaratively specify control within a planning (or theorem-proving) paradigm is necessary if we are to build intelligent machines. This paper introduces an implemen...