2585 search results - page 222 / 517 » Automating Coherent Logic |
184
click to vote
RR
2010
Springer
15 years 5 months ago
2010
Springer
Abstract. We illustrate the potential of conditional hedge transformations in Web-related applications on the example of PρLog: an extension of logic programming with advanced rul...
235
click to vote
DLOG
2011
14 years 10 months ago
2011
We prove co-N2ExpTime-hardness for conjunctive query entailment in the description logic ALCOIF , thus improving the previously known 2ExpTime lower bound. The result transfers to ...
263
click to vote
LPNMR
2011
Springer
14 years 10 months ago
2011
Springer
This paper investigates a new approach for computing the inference of defeasible logic. The algorithm proposed can substantially reduced the theory size increase due to transformat...
178
click to vote
DAC
2001
ACM
16 years 8 months ago
2001
ACM
We propose a new BDD-based method for decomposition of multi-output incompletely specified logic functions into netlists of two-input logic gates. The algorithm uses the internal ...
200
click to vote
CADE
2008
Springer
16 years 7 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...