Sciweavers

2067 search results - page 25 / 414
» Logics of propositional control
Sort
View
AIPS
1998
15 years 2 months ago
Encoding HTN Planning in Propositional Logic
Casting planning problems as propositional satis ability problems has recently been shown to be an effective way of scaling up plan synthesis. Until now, the bene ts of this appro...
Amol Dattatraya Mali, Subbarao Kambhampati
AIML
2008
15 years 3 months ago
On axiomatising products of Kripke frames, part II
We generalise some results of [7, 5] and show that if L is an -modal logic (for some ordinal 3) such that (i) L contains the product logic K and (ii) the product of -many trees o...
Agi Kurucz
JAPLL
2008
95views more  JAPLL 2008»
15 years 1 months ago
A note on an extension of PDL
Recently visibly pushdown automata have been extended to so called k-phase multistack visibly pushdown automata (k-MVPAs). On the occasion of introducing kMVPAs, it has been asked...
Stefan Göller, Dirk Nowotka
PLPV
2012
ACM
13 years 9 months ago
LTL types FRP: linear-time temporal logic propositions as types, proofs as functional reactive programs
Functional Reactive Programming (FRP) is a form of reactive programming whose model is pure functions over signals. FRP is often expressed in terms of arrows with loops, which is ...
Alan Jeffrey
TLCA
2005
Springer
15 years 7 months ago
Naming Proofs in Classical Propositional Logic
Abstract. We present a theory of proof denotations in classical propologic. The abstract definition is in terms of a semiring of weights, and two concrete instances are explored. ...
François Lamarche, Lutz Straßburger