Sciweavers

181 search results - page 32 / 37
» On the Completeness of Propositional Hoare Logic
Sort
View
FUIN
2007
134views more  FUIN 2007»
14 years 9 months ago
Complexity Issues in Multiagent Logics
Abstract. Our previous research presents a methodology of cooperative problem solving for beliefdesire-intention (BDI) systems, based on a complete formal theory called TEAMLOG. Th...
Marcin Dziubinski, Rineke Verbrugge, Barbara Dunin...
CORR
2006
Springer
131views Education» more  CORR 2006»
14 years 9 months ago
Intensional Models for the Theory of Types
In this paper we define intensional models for the classical theory of types, thus arriving at an intensional type logic ITL. Intensional models generalize Henkin's general m...
Reinhard Muskens
JANCL
2007
74views more  JANCL 2007»
14 years 9 months ago
Operations on proofs and labels
Logic of proofs LP introduced by S. Artemov in 1995 describes properties of proof predicate “t is a proof of F” in the propositional language extended by atoms of the form [[t...
Tatiana Yavorskaya, Natalia Rubtsova
94
Voted
CADE
2009
Springer
15 years 10 months ago
Superposition and Model Evolution Combined
We present a new calculus for first-order theorem proving with equality, ME+Sup, which generalizes both the Superposition calculus and the Model Evolution calculus (with equality)...
Peter Baumgartner, Uwe Waldmann
TASE
2008
IEEE
15 years 4 months ago
PDL over Accelerated Labeled Transition Systems
We present a thorough study of Propositional Dynamic Logic over a variation of labeled transition systems, called accelerated labelled transition systems, which are transition sys...
Taolue Chen, Jaco van de Pol, Yanjing Wang