2152 search results - page 56 / 431 » On Automating the Calculus of Relations |
102
click to vote
KR
2004
Springer
15 years 6 months ago
2004
Springer
The Fluent Calculus has largely been focused on building agents that work individually. However, agents often need to interact with each other to learn more about their environmen...
CADE
2003
Springer
16 years 28 days ago
2003
Springer
The DPLL procedure is the basis of some of the most successful propositional satisfiability solvers to date. Although originally devised as a proofprocedure for first-order logic, ...
121
click to vote
LICS
2006
IEEE
15 years 6 months ago
2006
IEEE
In this paper we show that the Stone representation theorem for Boolean algebras can be generalized to combinatory algebras. In every combinatory algebra there is a Boolean algebr...
155
Voted
VLDB
2007
ACM
16 years 25 days ago
2007
ACM
This demonstration showcases the STEP system for natural language access to relational databases. In STEP an administrator authors a highly structured semantic grammar through cou...
94
Voted
ASP
2001
Springer
15 years 4 months ago
2001
Springer
We propose a situation calculus formalization of action domains that include numeric-valued fluents (so-called additive or measure fluents) and concurrency. Our approach allows fo...