1321 search results - page 118 / 265 » Subtyping in Logical Form |
132
click to vote
CADE
2008
Springer
16 years 6 months ago
2008
Springer
Abstract. We present randoCoP, a theorem prover for classical firstorder logic, which integrates randomized search techniques into the connection prover leanCoP 2.0. By randomly re...
147
click to vote
EPIA
2007
Springer
15 years 11 months ago
2007
Springer
Abstract. The two puzzles are the Lottery Paradox and the Amalgamation Paradox, which both point out difficulties for aggregating uncertain information. A generalization of the lot...
161
click to vote
ADC
2006
Springer
15 years 11 months ago
2006
Springer
We extend Fagin’s result on the equivalence between functional dependencies in relational databases and propositional Horn clauses. It is shown that this equivalence still holds...
142
Voted
ICLP
2005
Springer
15 years 11 months ago
2005
Springer
This paper presents a reactive programming and triggering framework for the coordination of a large number of distributed agents with shared knowledge. At the heart of this framewo...
160
click to vote
TARK
2005
Springer
15 years 11 months ago
2005
Springer
s for Multi-Agent Only Knowing (extended abstract) Arild Waaler1,2 and Bjørnar Solhaug3,4 1 Finnmark College, Norway 2 Dep. of Informatics, University of Oslo, Norway 3 SINTEF ICT...