LFCS
2007
Springer
14 years 5 months ago
2007
Springer
We present a dynamic epistemic logic for knowledge change of rational agents. Existing approaches only deal with partial public announcements, that means an announcement may lead ...
LFCS
2007
Springer
14 years 5 months ago
2007
Springer
Abstract. Balanced search trees provide guaranteed worst-case time performance and hence they form a very important class of data structures. However, the self-balancing ability co...
LFCS
2007
Springer
14 years 5 months ago
2007
Springer
We present a general algorithm scheme for model checking logics of knowledge, common knowledge and linear time, based on simulations to a class of structures that capture the way t...
LFCS
2007
Springer
14 years 5 months ago
2007
Springer
act Completion (Full Version) Guillaume Burel Claude Kirchner August 6, 2007 Deduction Modulo implements Poincar´e’s principle by identifying deduction and computation as diff...
LFCS
2007
Springer
14 years 5 months ago
2007
Springer
LFCS
2007
Springer
14 years 5 months ago
2007
Springer
We introduce a natural deduction formulation for the Logic of Proofs, a refinement of modal logic S4 in which the assertion PA is replaced by [[s]]A whose intended reading is “s...
LFCS
2007
Springer
14 years 5 months ago
2007
Springer
LFCS
2007
Springer
14 years 5 months ago
2007
Springer
Logic programming with stable logic semantics (SLP) is a logical formalism that assigns to sets of clauses in the language admitting negations in the bodies a special kind of mode...
LFCS
2007
Springer
14 years 5 months ago
2007
Springer
Abstract. We consider weighted o-minimal hybrid systems, which extend classical o-minimal hybrid systems with cost functions. These cost functions are “observer variables” whic...
LFCS
2007
Springer
14 years 5 months ago
2007
Springer
Various logical formalisms with the freeze quantifier have been recently considered to model computer systems even though this is a powerful mechanism that often leads to undecida...