162 search results - page 9 / 33 » Completeness Guarantees for Incomplete Reasoners |
CAV
2010
Springer
15 years 1 months ago
2010
Springer
Synthesis of program fragments from specifications can make programs easier to write and easier to reason about. We present Comfusy, a tool that extends the compiler for the gener...
CADE
2008
Springer
15 years 10 months ago
2008
Springer
Tree automata completion is a technique for the verification of infinite state systems. It has already been used for the verification of cryptographic protocols and the prototyping...
TARK
2007
Springer
15 years 3 months ago
2007
Springer
This paper generalizes the notion of common p-beliefs to situations of ambiguity or Knightian uncertainty. When players have multiple prior beliefs,we show that Aumann’s no-agre...
CLIMA
2010
14 years 8 months ago
2010
Answer sharing is a key element in multi-agent systems as it allows agents to collaborate towards achieving a global goal. However exogenous knowledge of the world can influence e...
DLOG
2010
14 years 7 months ago
2010
We describe Orel, a reasoning system for an ontology language which subsumes both the EL and the RL profile of the recently standardised web ontology language OWL 2. Orel performs ...