284 search results - page 11 / 57 » Modularity of Completeness Revisited |
112
click to vote
CORR
2008
Springer
15 years 3 months ago
2008
Springer
In their seminal paper in the ACM Transactions on Software Engineering and Methodology, Zave and Jackson established a core ontology for Requirements Engineering (RE) and used it ...
116
Voted
TPLP
2008
15 years 3 months ago
2008
We present in this paper a first-order axiomatization of an extended theory T of finite or infinite trees, built on a signature containing an infinite set of function symbols and ...
128
click to vote
CPC
2004
15 years 3 months ago
2004
We consider boolean functions over n variables. Any such function can be represented (and computed) by a complete binary tree with and or or in the internal nodes and a literal in...
155
Voted
DLOG
2010
15 years 1 months ago
2010
Abstract. Inconsistency handling is of growing importance in Knowledge Representation since inconsistencies may frequently occur in an open world. Paraconsistent (or inconsistency-...
136
click to vote
MST
2010
14 years 10 months ago
2010
The 1-versus-2 queries problem, which has been extensively studied in computational complexity theory, asks in its generality whether every efficient algorithm that makes at most 2...