3047 search results - page 149 / 610 » On the Meaning of Logical Completeness |
104
click to vote
PLPV
2009
ACM
15 years 7 months ago
2009
ACM
We propose a new way to reason about general recursive functional programs in the dependently typed programming language Agda, which is based on Martin-L¨of’s intuitionistic ty...
ORL
2008
14 years 9 months ago
2008
We show that searching the k-change neighborhood is W[1]-hard for metric TSP, which means that finding the best tour in the k-change neighborhood essentially requires complete sea...
KR
1998
Springer
15 years 2 months ago
1998
Springer
The paper investigates the characterisation of vague concepts within the framework of modal logic. This work builds on the supervaluation approach of Fine and exploits the idea of...
100
click to vote
DBPL
2005
Springer
15 years 3 months ago
2005
Springer
We study peer-to-peer ðP2PÞ data integration, where each peer models an autonomous system that exports data in terms of its own schema, and data interoperation is achieved by me...
ECAI
2006
Springer
15 years 1 months ago
2006
Springer
Abstract. Most existing work on knowledge representation and reasoning assumes that the updating of beliefs is performed off-line, and that reasoning from the beliefs is performed ...