18 search results - page 1 / 4 » One More Decidable Class of Finitely Ground Programs |
ICLP
2009
Springer
14 years 5 months ago
2009
Springer
When a logic program is processed by an answer set solver, the first task is to generate its instantiation. In a recent paper, Calimeri et el. made the idea of efficient instantiat...
ICALP
1998
Springer
13 years 9 months ago
1998
Springer
We show that characteristic formulae for nite-state systems up to bisimulationlike equivalences (e.g., strong and weak bisimilarity) can be given in the simple branching-time temp...
ICALP
2009
Springer
14 years 5 months ago
2009
Springer
A one-sided (resp. two-sided) shift of finite type of dimension one can be described as the set of infinite (resp. bi-infinite) sequences of consecutive edges in a finite-state aut...
APLAS
2009
ACM
13 years 9 months ago
2009
ACM
In this paper we present polynomial time algorithms deciding branching bisimilarity between finite-state systems and several classes of infinite-state systems: BPA and normed BPP...
MST
2006
13 years 4 months ago
2006
We consider the transition graphs of regular ground tree (or term) rewriting systems. The vertex set of such a graph is a (possibly infinite) set of trees. Thus, with a finite tree...