141 search results - page 9 / 29 » Logical Reasoning for Higher-Order Functions with Local Stat... |
KR
2010
Springer
15 years 2 months ago
2010
Springer
This is a case-study in knowledge representation. We analyze the ‘one hundred prisoners and a lightbulb’ puzzle. In this puzzle it is relevant what the agents (prisoners) know...
112
click to vote
LPNMR
2001
Springer
15 years 1 months ago
2001
Springer
In this paper, we continue to explore many-valued disjunctive logic programs with probabilistic semantics. In particular, we newly introduce the least model state semantics for suc...
ECSQARU
2009
Springer
15 years 2 months ago
2009
Springer
Abstract. Even though in Artificial Intelligence, a set of classical logical formulae is often called a belief base, reasoning about beliefs requires more than the language of cla...
101
click to vote
TPHOL
1999
IEEE
15 years 1 months ago
1999
IEEE
Abstract. We describe the key features of the proof description language of Declare, an experimental theorem prover for higher order logic. We take a somewhat radical approach to p...
ESOP
2004
Springer
15 years 2 months ago
2004
Springer
t) Peter W. O’Hearn Queen Mary, University of London In the 1960s Dijkstra suggested that, in order to limit the complexity of potential process interactions, concurrent programs...