Sciweavers

171 search results - page 31 / 35
» Classical Logic, Continuation Semantics and Abstract Machine...
Sort
View
WADT
2004
Springer
14 years 1 months ago
Type Class Polymorphism in an Institutional Framework
Higher-order logic with shallow type class polymorphism is widely used as a specification formalism. Its polymorphic entities (types, operators, axioms) can easily be equipped wit...
Lutz Schröder, Till Mossakowski, Christoph L&...
IJFCS
2006
130views more  IJFCS 2006»
13 years 8 months ago
Mealy multiset automata
We introduce the networks of Mealy multiset automata, and study their computational power. The networks of Mealy multiset automata are computationally complete. 1 Learning from Mo...
Gabriel Ciobanu, Viorel Mihai Gontineac
ECSQARU
2001
Springer
14 years 1 months ago
On Anytime Coherence-Based Reasoning
Abstract. A great deal of research has been devoted to nontrivial reasoning in inconsistent knowledge bases. Coherence-based approaches proceed by a consolidation operation which s...
Frédéric Koriche
FM
2006
Springer
127views Formal Methods» more  FM 2006»
14 years 5 days ago
Using Domain-Independent Problems for Introducing Formal Methods
Abstract. The key to the integration of formal methods into engineering practice is education. In teaching, domain-independent problems -i.e., not requiring prior engineering backg...
Raymond T. Boute
CASES
2005
ACM
13 years 10 months ago
An Esterel processor with full preemption support and its worst case reaction time analysis
The concurrent synchronous language Esterel allows proto treat reactive systems in an abstract, concise manner. An Esterel program is typically first translated into other, non-s...
Xin Li, Jan Lukoschus, Marian Boldt, Michael Harde...