Sciweavers

3440 search results - page 484 / 688
» Logics For Context-Free Languages
Sort
View
GISCIENCE
2008
Springer
130views GIS» more  GISCIENCE 2008»
15 years 8 months ago
Road Networks and Their Incomplete Representation by Network Data Models
Road networks, roads, and junctions are examples of natural language terms whose semantics can be described by affordances of their physical referents. In order to define affordanc...
Simon Scheider, Werner Kuhn
AMAI
2006
Springer
15 years 7 months ago
Answer set based design of knowledge systems
The aim of this paper is to demonstrate that A-Prolog is a powerful language for the construction of reasoning systems. In fact, A-Prolog allows to specify the initial situation, t...
Marcello Balduccini, Michael Gelfond, Monica Nogue...
FAC
2008
92views more  FAC 2008»
15 years 7 months ago
Capture-avoiding substitution as a nominal algebra
Substitution is fundamental to the theory of logic and computation. Is substitution something that we define on syntax on a case-by-case basis, or can we turn the idea of substitut...
Murdoch James Gabbay, Aad Mathijssen
CORR
2006
Springer
105views Education» more  CORR 2006»
15 years 7 months ago
Knowledge Flow Analysis for Security Protocols
Knowledge flow analysis offers a simple and flexible way to find flaws in security protocols. A protocol is described by a collection of rules constraining the propagation of know...
Emina Torlak, Marten van Dijk, Blaise Gassend, Dan...
ENTCS
2006
123views more  ENTCS 2006»
15 years 7 months ago
From Discrete Duration Calculus to Symbolic Automata
The goal of this paper is to translate (fragments of) the quantified discrete duration calculus QDDC, proposed by P. Pandya, into symbolic acceptors with counters. Acceptors are w...
Laure Gonnord, Nicolas Halbwachs, Pascal Raymond