1055 search results - page 19 / 211 » Enumerations in computable structure theory |
CIE
2007
Springer
14 years 4 months ago
2007
Springer
Abstract. We show that many so called discrete weak semilattices considered earlier in a series of author’s publications have hereditary undecidable first-order theories. Since ...
AAAI
1990
13 years 11 months ago
1990
An algorithm is described which computes stable models of propositional logic programs with negation as failure using the Assumption Based Truth Maintenance mechanism. Since stabl...
LICS
2006
IEEE
14 years 4 months ago
2006
IEEE
Logical properties of iterations of relational structures are studied and these decidability results are applied to the model checking of a powerful extension of pushdown systems....
BIRTHDAY
2008
Springer
14 years 1 days ago
2008
Springer
The unfolding of a system represents in a single branching structure all its possible computations: it is the cornerstone both of semantical constructions and of efficient partial ...
VIS
2007
IEEE
14 years 11 months ago
2007
IEEE
Abstract--The recently introduced notion of Finite-Time Lyapunov Exponent to characterize Coherent Lagrangian Structures provides a powerful framework for the visualization and ana...