Sciweavers

342 search results - page 46 / 69
» Tableau Algorithms for Description Logics
Sort
View
AIL
2000
78views more  AIL 2000»
14 years 9 months ago
Representation of formal dispute with a standing order
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...
Gerard Vreeswijk
SEMWEB
2004
Springer
15 years 2 months ago
Query Answering for OWL-DL with Rules
Both OWL-DL and function-free Horn rules3 are decidable logics with interesting, yet orthogonal expressive power: from the rules perspective, OWL-DL is restricted to tree-like rule...
Boris Motik, Ulrike Sattler, Rudi Studer
LPNMR
1995
Springer
15 years 1 months ago
Skeptical Rational Extensions
In this paper we propose a version of default logic with the following two properties: (1) defaults with mutually inconsistent justications are never used together in constructing ...
Artur Mikitiuk, Miroslaw Truszczynski
DAC
2007
ACM
15 years 10 months ago
Progressive Decomposition: A Heuristic to Structure Arithmetic Circuits
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...
Ajay K. Verma, Philip Brisk, Paolo Ienne
DAC
1994
ACM
15 years 1 months ago
Functional Test Generation for FSMs by Fault Extraction
Recent results indicate that functional test pattern generation (TPG) techniques may provide better defect coverages than do traditional logic-level techniques. Functional TPG alg...
Bapiraju Vinnakota, Jason Andrews