4617 search results - page 570 / 924 » Automation of Diagrammatic Reasoning |
216
click to vote
LPAR
2001
Springer
16 years 1 days ago
2001
Springer
Abstract. Recently, local logics for Mazurkiewicz traces are of increasing interest. This is mainly due to the fact that the satisfiability problem has the same complexity as in t...
203
click to vote
LPNMR
2001
Springer
16 years 1 days ago
2001
Springer
Abstract. According to Dynamic Logic Programming (DLP), knowledge may be given by a sequence of theories (encoded as logic programs) representing different states of knowledge. Th...
207
click to vote
LPNMR
2001
Springer
16 years 1 days 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 ...
268
click to vote
LICS
2000
IEEE
15 years 12 months ago
2000
IEEE
We prove that several problems concerning congruences on algebras are complete for nondeterministic log-space. These problems are: determining the congruence on a given algebra gen...
192
click to vote
LICS
2000
IEEE
15 years 12 months ago
2000
IEEE
We study definability and complexity issues for automatic and ω-automatic structures. These are, in general, infinite structures but they can be finitely presented by a collec...