Sciweavers

2062 search results - page 165 / 413
» Derivatives of Logical Formulas
Sort
View
FOSSACS
2008
Springer
15 years 5 months ago
What Else Is Decidable about Integer Arrays?
We introduce a new decidable logic for reasoning about infinite arrays of integers. The logic is in the first-order fragment and allows (1) Presburger constraints on existentially...
Peter Habermehl, Radu Iosif, Tomás Vojnar
BDA
2006
15 years 5 months ago
Capturing well typed references in DTDs
Surprisingly enough, there has been few investigations for typing references of semistructured data and XML documents. This paper build on a previous proposal [7] introducing simp...
Nicole Bidoit, Dario Colazzo
AAAI
1998
15 years 5 months ago
A Non-Deterministic Semantics for Tractable Inference
Unit resolution is arguably the most useful known algorithm for tractable reasoning in propositional logic. Intuitively, if one knows a, b, and a b c, then c should be an obviou...
James M. Crawford, David W. Etherington
IJCAI
1993
15 years 5 months ago
Notes on Formalizing Context
These notes discuss formalizing contexts as first class objects. The basic relation is ist(c, p). It asserts that the proposition p is true in the context c. The most important f...
John McCarthy
CORR
2006
Springer
86views Education» more  CORR 2006»
15 years 4 months ago
Semantic results for ontic and epistemic change
We present an epistemic logic incorporating dynamic operators to describe information changing events. Such events include epistemic changes, where agents become more informed abo...
Hans P. van Ditmarsch, Barteld P. Kooi