1462 search results - page 188 / 293 » Autoepistemic Description Logics |
198
click to vote
JAPLL
2007
15 years 6 months ago
2007
We extend answer set programming (ASP) with, possibly infinite, open domains. Since this leads to undecidable reasoning, we restrict the syntax of programs, while carefully guard...
149
click to vote
AIL
2000
15 years 6 months ago
2000
Computational dialectics is a relatively new field. It is, among others, concerned with the formal representation of argument and dispute. The goal is to suggest algorithms, proce...
186
click to vote
IDT
2010
15 years 4 months ago
2010
Humans know how to reason based on cause and effect, but cause and effect is not enough to draw conclusions due to the problem of imperfect information and uncertainty. To resol...
185
click to vote
SEMWEB
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. OWL-S allows selecting, composing and invoking Web Serdifferent levels of abstraction: selection uses high level abstract descriptions, invocation uses low level groundi...
169
click to vote
DAC
2007
ACM
16 years 7 months ago
2007
ACM
Despite the impressive progress of logic synthesis in the past decade, finding the best architecture for a given circuit still remains an open problem and largely unsolved. In mos...