Sciweavers

C3S2E
2010
ACM
14 years 20 days ago
Scalable formula decomposition for propositional satisfiability
Propositional satisfiability solving, or SAT, is an important reasoning task arising in numerous applications, such as circuit design, formal verification, planning, scheduling or...
Anthony Monnet, Roger Villemaire
DLOG
2006
14 years 29 days ago
Conjunctive Query Answering for Description Logics with Transitive Roles
An important reasoning task, in addition to the standard DL reasoning services, is conjunctive query answering. In this paper, we present algorithms for conjunctive query answerin...
Birte Glimm, Ian Horrocks, Ulrike Sattler