454 search results - page 19 / 91 » Representation results for defeasible logic |
89
Voted
IOLTS
2008
IEEE
15 years 7 months ago
2008
IEEE
Sets of Pairs of Functions to be Distinguished (SPFD) is a functional flexibility representation method that was recently introduced in the logic synthesis domain, and promises s...
151
Voted
DAC
2006
ACM
16 years 1 months ago
2006
ACM
- Classical two-variable symmetries play an important role in many EDA applications, ranging from logic synthesis to formal verification. This paper proposes a complete circuit-bas...
102
Voted
ICDAR
2005
IEEE
15 years 6 months ago
2005
IEEE
This article presents Xed, a reverse engineering tool for PDF documents, which extracts the original document layout structure. Xed mixes electronic extraction methods with state-...
120
click to vote
CADE
2000
Springer
15 years 4 months ago
2000
Springer
We provide techniques to integrate resolution logic with equality in type theory. The results may be rendered as follows. − A clausification procedure in type theory, equipped w...
70
Voted
FOIS
2010
15 years 1 months ago
2010
Abstract. In this paper we show how the relationships between first-order ontologies within a repository can be used to support ontology verification. We discuss the use of represe...