598 search results - page 60 / 120 » Optimized Reasoning in Description Logics Using Hypertableau... |
123
Voted
JAIR
2007
15 years 1 months ago
2007
This work is a contribution to prioritized reasoning in logic programming in the presence of preference relations involving atoms. The technique, providing a new interpretation fo...
102
click to vote
GLVLSI
2006
IEEE
15 years 7 months ago
2006
IEEE
Most of the logic synthesis algorithms are not scalable for large networks and, for this reason, partitioning is often applied. However traditional mincut-based partitioning techn...
116
click to vote
CADE
2007
Springer
16 years 1 months ago
2007
Springer
We present an encoding that is able to specify LTL bounded model checking problems within the Bernays-Sch?onfinkel fragment of first-order logic. This fragment, which also correspo...
159
Voted
TABLEAUX
2000
Springer
15 years 5 months ago
2000
Springer
FaCT (Fast Classification of Terminologies) is a Description Logic (DL) classifier that can also be used for modal logic satisfiability testing. The FaCT system includes two reason...
92
Voted
LPNMR
2005
Springer
15 years 7 months ago
2005
Springer
Two approaches to logic programming with probabilities emerged over time: bayesian reasoning and probabilistic satisfiability (PSAT). The attractiveness of the former is in tying ...