156 search results - page 1 / 32 » Decidability and Undecidability in Probability Logic |
LFCS
2009
Springer
13 years 11 months ago
2009
Springer
We study computational aspects of a probabilistic logic based on a well-known model of induction by Valiant. We prove that for this paraconsistent logic the set of valid formulas ...
CSL
2004
Springer
13 years 10 months ago
2004
Springer
To reason effectively about programs, it is important to have some version of a transitive-closure operator so that we can describe such notions as the set of nodes reachable from ...
ECAI
2010
Springer
13 years 5 months ago
2010
Springer
Abstract. Interval temporal logics formalize reasoning about interval structures over (usually) linearly ordered domains, where time intervals are the primitive ontological entitie...
IJCAI
2003
13 years 6 months ago
2003
The evolution of Description Logics (DLs) and Propositional Dynamic Logics produced a hierar chy of decidable logics with multiple maximal el ements. It would be desirable to ...
JAIR
2011
12 years 11 months ago
2011
We define a logic of propositional formula schemata adding to the syntax of propositional logic indexed propositions (e.g., pi) and iterated connectives ∨ or ∧ ranging over i...