Sciweavers

3358 search results - page 94 / 672
» Dynamic Description Logics
Sort
View
TOCL
2008
128views more  TOCL 2008»
13 years 9 months ago
A comprehensive combination framework
fragment enjoys suitable noetherianity conditions and admits an abstract version of a `KeislerShelah like' isomorphism theorem. We show that this general decidability transfer...
Silvio Ghilardi, Enrica Nicolini, Daniele Zucchell...
IEEESCC
2005
IEEE
14 years 3 months ago
Web Services Composition: A Story of Models, Automata, and Logics
eal world”, represented abstractly using (time-varying) first-order logic predicates and terms. A representative composition result [11] here uses a translation into Petri nets. ...
Richard Hull
CADE
2008
Springer
13 years 12 months ago
Automated Implicit Computational Complexity Analysis (System Description)
Recent studies have provided many characterisations of the class of polynomial time computable functions through term rewriting techniques. In this paper we describe a (fully autom...
Martin Avanzini, Georg Moser, Andreas Schnabl
EACL
2003
ACL Anthology
13 years 11 months ago
AVM Description Compilation using Types as Modes
This paper provides a method for generating compact and efficient code to implement the enforcement of a description in typed feature logic. It does so by viewing information abo...
Gerald Penn
IPL
2006
120views more  IPL 2006»
13 years 10 months ago
Propositional dynamic logic of context-free programs and fixpoint logic with chop
This paper compares Propositional Dynamic Logic of Non-Regular Programs and Fixpoint Logic with Chop. It identifies a fragment of the latter which is equiexpressive to the former....
Martin Lange, Rafal Somla