Sciweavers

311 search results - page 27 / 63
» A Bialgebraic Approach to Automata and Formal Language Theor...
Sort
View
FOSSACS
2005
Springer
14 years 2 months ago
Third-Order Idealized Algol with Iteration Is Decidable
The problems of contextual equivalence and approximation are studied for the third-order fragment of Idealized Algol with iteration (IA∗ 3). They are approached via a combination...
Andrzej S. Murawski, Igor Walukiewicz
CORR
1998
Springer
94views Education» more  CORR 1998»
13 years 8 months ago
Semantics and Conversations for an Agent Communication Language
We address the issues of semantics and conversations for agent communication languages and the Knowledge Query Manipulation Language (KQML) in particular. Based on ideas from spee...
Yannis Labrou, Timothy W. Finin
IJCAI
1989
13 years 9 months ago
Formal Properties and Implementation of Bidirectional Charts
Several theories of grammar currently converge toward inserting subcategorization information within lexical entries. Such a tendency would benefit from a parsing algorithm able t...
Giorgio Satta, Oliviero Stock
LATA
2010
Springer
14 years 6 months ago
Complexity of the Satisfiability Problem for a Class of Propositional Schemata
Abstract. Iterated schemata allow to define infinite languages of propositional formulae through formulae patterns. Formally, schemata extend propositional logic with new (generali...
Vincent Aravantinos, Ricardo Caferra, Nicolas Pelt...
CAV
2009
Springer
215views Hardware» more  CAV 2009»
14 years 9 months ago
Homer: A Higher-Order Observational Equivalence Model checkER
We present HOMER, an observational-equivalence model checker for the 3rd-order fragment of Idealized Algol (IA) augmented with iteration. It works by first translating terms of the...
David Hopkins, C.-H. Luke Ong