Most of AI research on temporal reasoning has been devoted to either exploring constraint-based temporal deduction techniques or investigating diverse logics extended with time. Nevertheless the formal study of deductive systems for such temporal extended logics has received little attention. This paper presents a general framework for temporal reasoning in knowledge-based systems resulting fro...

The do-calculus was developed in 1995 to facilitate theidentification of causal effects in non-parametric mod-els. The completeness proofs of [Huang and Valtorta,2006] and [Shpitser and Pearl, 2006] and the graphi-cal criteria of [Tian and Shpitser, 2010] have laid thisidentification problem to rest. Recent explorations un-veil the usefulness of the do-calculus in three ...

The logic of context with the ist (c;p) modality has been proposed by McCarthy as a foundation for con-textual reasoning. This paper shows that proposi-tional logic of context is NP-complete and therefore more tractable than multimodal logics or Multi Language hierarchical logics which are PSPACE-complete. This result is given in a proof-theoretical way by providing a tableau calculus, which ca...

We investigated numerically an Ising model coupled to two-dimensional Euclidean gravity with spherical topology, using Regge calculus with the dl=l path-integral measure to discretize the gravita-tional interaction. Previous studies of this system with toroidal topol-ogy have shown that the critical behavior of the Ising model remains in the at-space Onsager universality class, contrary to the ...

The network calculus is a framework for the analysis of communication net-works, which exploits that many computer network models become tractablefor analysis if they are expressed in a min-plus or max-plus algebra. In amin-plus algebra, the network calculus characterizes amounts of traffic andavailable service as functions of time. In a max-plus algebra, the network cal-cul...

(Abstract) In [6] Prior proposed a modal calculus, M IP C, which is an extension of the intuitionist propositional calculus. This system, which I call S 5 IC, turns out to be the intuitionist analogue of Lewis's S 5 in the sense that 1) S 5 IC plus A ∨ ¬A is equivalent to S 5 , 2) collapsing the modal operators yields Heyting's calculus. The question as to whether S 5 IC is to be considered ana...

Impressive work has been done in the last years concerning the meaning of negation and disjunction in logic programs, but most of this research concentrated on propositional programs only. While it suuces to consider the propositional case for investigating general properties and the overall behaviour of a semantics, we feel that for real applications and for computational purposes an implement...

The paper demonstrates how second-order quantiication and nite games can be exploited for deciding complicated propositional program logics like the propositional-Calculus with converse (C ?). This approach yields a new proof that C ? is in EXP T IME. Automata-theoretic technique is a very powerful and popular approach for deciding complicated propositional program logics 19, 20, 3]. The rst pa...