Sciweavers

598 search results - page 60 / 120
» Optimized Reasoning in Description Logics Using Hypertableau...
Sort
View
JAIR
2007
121views more  JAIR 2007»
14 years 9 months ago
On the Semantics of Logic Programs with Preferences
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...
Sergio Greco, Irina Trubitsyna, Ester Zumpano
GLVLSI
2006
IEEE
124views VLSI» more  GLVLSI 2006»
15 years 4 months ago
Dominator-based partitioning for delay optimization
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...
David Bañeres, Jordi Cortadella, Michael Ki...
CADE
2007
Springer
15 years 10 months ago
Encodings of Bounded LTL Model Checking in Effectively Propositional Logic
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...
Andrei Voronkov, Juan Antonio Navarro Pérez
TABLEAUX
2000
Springer
15 years 1 months ago
Benchmark Analysis with FaCT
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...
Ian Horrocks
LPNMR
2005
Springer
15 years 3 months ago
Revisiting the Semantics of Interval Probabilistic Logic Programs
Two approaches to logic programming with probabilities emerged over time: bayesian reasoning and probabilistic satisfiability (PSAT). The attractiveness of the former is in tying ...
Alex Dekhtyar, Michael I. Dekhtyar