Sciweavers

3719 search results - page 38 / 744
» order 2010
Sort
View
RTA
2010
Springer
14 years 1 months ago
Order-Sorted Unification with Regular Expression Sorts
Abstract. We extend first-order order-sorted unification by permitting regular expression sorts for variables and in the domains of function symbols. The set of basic sorts is ...
Temur Kutsia, Mircea Marin
CADE
2010
Springer
13 years 11 months ago
Monotonicity Inference for Higher-Order Formulas
Abstract. Formulas are often monotonic in the sense that if the formula is satisfiable for given domains of discourse, it is also satisfiable for all larger domains. Monotonicity i...
Jasmin Christian Blanchette, Alexander Krauss
CSL
2010
Springer
13 years 11 months ago
The Complexity of Positive First-Order Logic without Equality II: The Four-Element Case
We study the complexity of evaluating positive equality-free sentences of first-order (FO) logic over fixed, finite structures B. This may be seen as a natural generalisation of th...
Barnaby Martin, Jos Martin
CORR
2010
Springer
137views Education» more  CORR 2010»
13 years 10 months ago
State Elimination Ordering Strategies: Some Experimental Results
Recently, the problem of obtaining a short regular expression equivalent to a given finite automaton has been intensively investigated. Algorithms for converting finite automata to...
Nelma Moreira, Davide Nabais, Rogério Reis
CORR
2010
Springer
105views Education» more  CORR 2010»
13 years 10 months ago
Nominal Unification from a Higher-Order Perspective
Abstract. Nominal Logic is an extension of first-order logic with equality, name-binding, name-swapping, and freshness of names. Contrarily to higher-order logic, bound variables a...
Jordi Levy, Mateu Villaret