3658 search results - page 454 / 732 » The logic of proofs, semantically |
171
click to vote
AI
2005
Springer
15 years 6 months ago
2005
Springer
We consider the problem of how an agent's knowledge can be updated. We propose a formal method of knowledge update on the basis of the semantics of modal logic S5. In our met...
130
click to vote
CADE
2006
Springer
16 years 7 months ago
2006
Springer
We developed an importer from both HOL 4 and HOL-light into Isabelle/HOL. The importer works by replaying proofs within Isabelle/HOL that have been recorded in HOL 4 or HOL-light a...
146
click to vote
CADE
2001
Springer
16 years 7 months ago
2001
Springer
Abstract. This paper presents a technique for automated theorem proving with free variable tableaux that does not require backtracking. Most existing automated proof procedures usi...
149
click to vote
FM
2009
Springer
16 years 1 months ago
2009
Springer
Verification methods for memory-manipulating C programs need to address not only well-typed programs that respect invariants such as the split heap memory model, but also programs...
201
Voted
TABLEAUX
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. We give an optimal (exptime), sound and complete tableaubased algorithm for deciding satisfiability with respect to a TBox in the logic ALCI using global state caching. ...