80 search results - page 13 / 16 » On the Complexity of Reasoning in Kleene Algebra |
ENTCS
2006
14 years 10 months ago
2006
The problem of obtaining small conflict clauses in SMT systems has received a great deal of attention recently. We report work in progress to find small subsets of the current par...
ECTEL
2008
Springer
15 years 2 days ago
2008
Springer
Abstract. Expressing generality, recognising and analysing patterns and articulating structure is a complex task and one that is invariably problematic for students. Nonetheless, v...
FAC
2002
14 years 10 months ago
2002
Action calculi, which generalise process calculi such as Petri nets, -calculus and ambient calculus, have been presented in terms of action graphs. We here offer linear action grap...
TPHOL
2005
IEEE
15 years 3 months ago
2005
IEEE
We describe a formalization of the elementary algebra, topology and analysis of finite-dimensional Euclidean space in the HOL Light theorem prover. (Euclidean space is RN with the...
CSL
2006
Springer
15 years 2 months ago
2006
Springer
Abstract. We investigate the possibility of (bi)simulation-like preorder/equivalence checking on the class of visibly pushdown automata and its natural subclasses visibly BPA (Basi...