Sciweavers

1809 search results - page 249 / 362
» A Formal Specification of dMARS
Sort
View
AMW
2010
13 years 11 months ago
On the Decidability of Consistent Query Answering
Abstract. Consistent query answering (CQA) is about formally characterizing and computing semantically correct answers to queries posed to a database that may fail to satisfy certa...
Marcelo Arenas, Leopoldo E. Bertossi
COMMA
2006
13 years 11 months ago
Evaluation and comparison criteria for extension-based argumentation semantics
In the context of Dung's theory of abstract argumentation frameworks, the comparison between different semantics is often carried out by resorting to some specific examples co...
Pietro Baroni, Massimiliano Giacomin
JLP
2008
123views more  JLP 2008»
13 years 9 months ago
Communicating by compatibility
A bio-inspired language is presented. Its terms are processes enclosed into boxes with typed interaction sites. The main feature of the formalism lays in the fact that the key-loc...
Davide Prandi, Corrado Priami, Paola Quaglia
JUCS
2006
97views more  JUCS 2006»
13 years 9 months ago
An Interval Constraint Branching Scheme for Lattice Domains
This paper presents a parameterized schema for interval constraint branching that (with suitable instantiations of the parameters) can solve interval constraint satisfaction probl...
Antonio J. Fernández, Patricia M. Hill
ENTCS
2002
77views more  ENTCS 2002»
13 years 9 months ago
The variety of variables in computer-aided real-time programming
The refinement calculus is a well-established theory for translating specifications to program code. Recent research has extended the calculus to handle real-time requirements and...
Luke Wildman, Colin J. Fidge