115 search results - page 19 / 23 » Decision Problems for Propositional Linear Logic |
ENTCS
2006
13 years 7 months ago
2006
In the past, partial order reduction has been used successfully to combat the state explosion problem in the context of model checking for non-probabilistic systems. For both line...
DAGSTUHL
2007
13 years 8 months ago
2007
Abstract. Well-founded orders are the most basic, but also most important ingredient to virtually all termination analyses. Numerous fully automated search algorithms for these cla...
LPNMR
2001
Springer
13 years 11 months ago
2001
Springer
Schlipf (Sch95) proved that Stable Logic Programming (SLP) solves all NP decision problems. We extend Schlipf’s result to prove that SLP solves all search problems in the class ...
HYBRID
1999
Springer
13 years 11 months ago
1999
Springer
Abstract. One of the most important analysis problems of hybrid systems is the reachability problem. State of the art computational tools perform reachability computation for timed...
ICCBR
2007
Springer
13 years 11 months ago
2007
Springer
Case-based reasoning aims at solving a problem by the adaptation of the solution of an already solved problem that has been retrieved in a case base. This paper defines an approach...