Sciweavers

1650 search results - page 22 / 330
» The HOM problem is decidable
Sort
View
ICALP
2009
Springer
14 years 8 months ago
Decidability of Conjugacy of Tree-Shifts of Finite Type
A one-sided (resp. two-sided) shift of finite type of dimension one can be described as the set of infinite (resp. bi-infinite) sequences of consecutive edges in a finite-state aut...
Nathalie Aubrun, Marie-Pierre Béal
CSL
2005
Springer
14 years 1 months ago
Decidability of Type-Checking in the Calculus of Algebraic Constructions with Size Annotations
Since Val Tannen's pioneering work on the combination of simply-typed λ-calculus and rst-order rewriting [11], many authors have contributed to this subject by extending it ...
Frédéric Blanqui
LICS
2012
IEEE
11 years 10 months ago
Graph Logics with Rational Relations and the Generalized Intersection Problem
Abstract—We investigate some basic questions about the interaction of regular and rational relations on words. The primary motivation comes from the study of logics for querying ...
Pablo Barceló, Diego Figueira, Leonid Libki...
LPAR
2007
Springer
14 years 1 months ago
Deciding Knowledge in Security Protocols for Monoidal Equational Theories
Abstract. In formal approaches, messages sent over a network are usually modeled by terms together with an equational theory, axiomatizing the properties of the cryptographic funct...
Véronique Cortier, Stéphanie Delaune
AAAI
1990
13 years 8 months ago
Decidable Reasoning in First-Order Knowledge Bases with Perfect Introspection
Since knowledge bases (KBs) are usually incomplete, they should be able to provide information regarding their own incompleteness, which requires them to introspect on what they k...
Gerhard Lakemeyer