3047 search results - page 294 / 610 » On the Meaning of Logical Completeness |
217
click to vote
KR
1998
Springer
15 years 11 months ago
1998
Springer
A theory is elaboration tolerant to the extent that new information can be incorporated with only simple changes. The simplest change is conjoining new information, and only conju...
182
click to vote
POPL
2010
ACM
16 years 5 months ago
2010
ACM
d by recent research in abstract model checking, we present a new approach to inferring dependent types. Unlike many of the existing approaches, our approach does not rely on prog...
192
click to vote
ATAL
2010
Springer
15 years 8 months ago
2010
Springer
An organizational modeling language can be used to specify an agent organization in terms of its roles, organizational structure, norms, etc. Such an organizational specification ...
162
Voted
CIKM
2009
Springer
16 years 2 months ago
2009
Springer
PN refer to the set of ties a specific individual has with other people. There is significant variation in the size of an individual’s PN and this paper explores the effect o...
200
click to vote
AAAI
1990
15 years 8 months ago
1990
This work pertains to the Knuth-Bendix (KB) algorithm which tries to find a complete set of reductions from a given set of equations. In the KB algorithm a term ordering is employ...