2540 search results - page 60 / 508 » Abstract Logics as Dialgebras |
182
click to vote
CADE
2008
Springer
16 years 6 months ago
2008
Springer
Abstract. Conjunctive query answering plays a prominent role in applications of description logics (DLs) that involve instance data, but its exact complexity was a long-standing op...
134
click to vote
ICCD
2004
IEEE
16 years 3 months ago
2004
IEEE
Abstract— This paper proposes a technique for creating a combinational logic network with an output that signals when all other outputs have stabilized. The method is based on du...
136
click to vote
ATVA
2009
Springer
16 years 29 days ago
2009
Springer
We present a data symmetry reduction approach for model temporal-epistemic logic. The technique abstracts the epistemic indistinguishably relation for the knowledge operators, and ...
168
click to vote
MLG
2007
Springer
16 years 15 days ago
2007
Springer
Abstract. There are many connections between graph mining and inductive logic programming (ILP), or more generally relational learning. Up till now these connections have mostly be...
166
click to vote
CSL
2005
Springer
15 years 12 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...