2291 search results - page 165 / 459 » Logic Programming and Model Checking |
125
Voted
CORR
2002
Springer
15 years 2 months ago
2002
Springer
Abstract. We study algorithms for computing stable models of propositional logic programs and derive estimates on their worst-case performance that are asymptotically better than t...
132
click to vote
BPM
2008
Springer
15 years 4 months ago
2008
Springer
Complex and flexible business processes are critical not only because they are difficult to handle, but also because they often tend to loose their intelligibility. Verifying compl...
139
Voted
IJCAI
2007
15 years 4 months ago
2007
The definition of a stable model has provided a declarative semantics for Prolog programs with negation as failure and has led to the development of answer set programming. In th...
180
Voted
CORR
2004
Springer
15 years 2 months ago
2004
Springer
We introduce regular graph constraints and explore their decidability properties. The motivation for regular graph constraints is 1) type checking of changing types of objects in ...
120
Voted
IWFM
1998
15 years 4 months ago
1998
We study strictly level-decreasing logic programs (sld-programs) as defined earlier by the present authors. It will be seen that sld-programs, unlike most other classes of logic p...