454 search results - page 38 / 91 » Representation results for defeasible logic |
CSL
2001
Springer
14 years 1 months ago
2001
Springer
Abstract. In classical approaches to knowledge representation, reasoners are assumed to derive all the logical consequences of their knowledge base. As a result, reasoning in the ï...
ITC
1994
IEEE
14 years 23 days ago
1994
IEEE
Previous approaches to designing random pattern testable circuits use post-synthesis test point insertion to eliminate random pattern resistant (r.p.r.) faults. The approach taken...
ENTCS
2002
13 years 8 months ago
2002
We present a declarative debugger for lazy functional logic programs with polymorphic type discipline. Whenever a computed answer is considered wrong by the user (error symptom), ...
AI
2011
Springer
13 years 3 months ago
2011
Springer
An important question for the upcoming Semantic Web is how to best combine open world ontology languages, such as the OWL-based ones, with closed world rule-based languages. One o...
FCSC
2011
13 years 4 days ago
2011
Description logics (DLs) are widely employed in recent semantic web application systems. However, classical description logics are limited when dealing with imprecise concepts and ...