Sciweavers

1391 search results - page 124 / 279
» Completeness of Neighbourhood Logic
Sort
View
LICS
2005
IEEE
14 years 2 months ago
Model-Checking Hierarchical Structures
Hierarchical graph definitions allow a modular description of graphs using modules for the specification of repeated substructures. Beside this modularity, hierarchical graph de...
Markus Lohrey
FORMATS
2004
Springer
14 years 2 months ago
Model-Checking for Weighted Timed Automata
We study the model-checking problem for weighted timed automata and the weighted CTL logic by the bisimulation approach. Weighted timed automata are timed automata extended with co...
Thomas Brihaye, Véronique Bruyère, J...
PPDP
2004
Springer
14 years 2 months ago
A lazy narrowing calculus for declarative constraint programming
The new generic scheme CFLP(D) has been recently proposed in [24] as a logical and semantic framework for lazy constraint functional logic programming over a parametrically given ...
Francisco Javier López-Fraguas, Mario Rodr&...
CAISE
1999
Springer
14 years 1 months ago
Modeling Dynamic Domains with ConGolog
In this paper, we describe the process specification language ConGolog and show how it can be used to model business processes for requirements analysis. In ConGolog, the effects...
Yves Lespérance, Todd G. Kelley, John Mylop...
ECAI
2006
Springer
14 years 29 days ago
Knowing Minimum/Maximum n Formulae
Abstract. We introduce a logical language with nullary operators min(n), for each non-negative integer n, which mean `the reasoner has at least n different beliefs'. The resul...
Thomas Ågotnes, Natasha Alechina