Sciweavers

210 search results - page 8 / 42
» Definability and automorphisms in abstract logics
Sort
View
ICALP
2000
Springer
13 years 11 months ago
On the Power of Tree-Walking Automata
Abstract. Tree-walking automata (TWAs) recently received new attention in the fields of formal languages and databases. Towards a better understanding of their expressiveness, we c...
Frank Neven, Thomas Schwentick
CORR
2004
Springer
120views Education» more  CORR 2004»
13 years 7 months ago
Validating a Web Service Security Abstraction by Typing
Abstraction by Typing Andrew D. Gordon Microsoft Research Riccardo Pucella Cornell University An XML web service is, to a first approximation, an RPC service in which requests and...
Andrew D. Gordon, Riccardo Pucella
ENTCS
2002
125views more  ENTCS 2002»
13 years 7 months ago
Specification of Logic Programming Languages from Reusable Semantic Building Blocks
We present a Language Prototyping System that facilitates the modular development of interpreters from independent semantic buildks. The abstract syntax is modelled as the fixpoint...
José Emilio Labra Gayo, Juan Manuel Cueva L...
SUM
2010
Springer
13 years 5 months ago
A Formal Analysis of Logic-Based Argumentation Systems
Dung's abstract argumentation model consists of a set of arguments and a binary relation encoding attacks among arguments. Different acceptability semantics have been defined ...
Leila Amgoud, Philippe Besnard
WFLP
2000
Springer
163views Algorithms» more  WFLP 2000»
13 years 11 months ago
Cooperative Constraint Functional Logic Programming
We describe the current status of the development of CFLP, a system which aims at the integration of the best features of functional logic programming (FLP), cooperative constrain...
Mircea Marin, Tetsuo Ida