Sciweavers

391 search results - page 15 / 79
» Formal Universes
Sort
View
106
Voted
ACL
2009
14 years 10 months ago
A Polynomial-Time Parsing Algorithm for TT-MCTAG
This paper investigates the class of TreeTuple MCTAG with Shared Nodes, TTMCTAG for short, an extension of Tree Adjoining Grammars that has been proposed for natural language proc...
Laura Kallmeyer, Giorgio Satta
SEKE
1995
Springer
15 years 3 months ago
Visual Scenarios for Validation of Requirements Specification
The development of a large information system is generally regarded as one of the most complex activities undertaken by organizations and it is dependent on the communication and u...
V. Lalioti, Babis Theodoulidis
95
Voted
FOSSACS
2004
Springer
15 years 5 months ago
Duality for Labelled Markov Processes
Labelled Markov processes (LMPs) are automata whose transitions are given by probability distributions. In this paper we present a ‘universal’ LMP as the spectrum of a commutat...
Michael W. Mislove, Joël Ouaknine, Dusko Pavl...
FM
2009
Springer
118views Formal Methods» more  FM 2009»
15 years 7 months ago
Abstract Object Creation in Dynamic Logic
Object Creation in Dynamic Logic to be or not to be created Wolfgang Ahrendt1 Frank S. de Boer2 Immo Grabe3 1Chalmers University, G¨oteborg, Sweden 2CWI, Amsterdam, The Netherland...
Wolfgang Ahrendt, Frank S. de Boer, Immo Grabe
ATAL
2010
Springer
15 years 1 months ago
Cooperative problem solving against adversary: quantified distributed constraint satisfaction problem
In this paper, we extend the traditional formalization of a Distributed Constraint Satisfaction Problems (DisCSP) to a Quantified DisCSP. A Quantified DisCSP includes several unive...
Satomi Baba, Atsushi Iwasaki, Makoto Yokoo, Marius...