381 search results - page 21 / 77 » Tableaux for Acceptance Logic |
CSL
2005
Springer
14 years 2 months ago
2005
Springer
Abstract. Focusing is traditionally seen as a means of reducing inessential nondeterminism in backward-reasoning strategies such as uniform proof-search or tableaux systems. In thi...
ISMIS
1994
Springer
14 years 23 days ago
1994
Springer
BDDs (binary decision diagrams) are a very succesful tool for handling boolean functions, but one which has not yet attracted the attention of many automated deduction specialists....
ESWS
2009
Springer
14 years 3 months ago
2009
Springer
This paper investigates a Description Logic, namely SHI+, which extends SHI by adding transitive closure of roles. The resulting logic SHI+ allows transitive closure of roles to oc...
TABLEAUX
2009
Springer
14 years 3 months ago
2009
Springer
Abstract. The management of qualitative spatial information is an important research area in computer science and AI. Modal logic provides a natural framework for the formalization...
IPL
2002
13 years 8 months ago
2002
Weak acceptance conditions for automata on infinite words or trees are defined in terms of the set of states that appear in the run. This is in contrast with, more usual, strong c...