-
Ticket Entailment is decidable
Submitted on 06/09/2010 to Math. Struct. in Comp. Science. Accepted for publication on 12/19/2011. Last revision on 03/06/2012 -
Insights into Modal Slash Logic and Modal Decidability
Publication in the series REPORTS IN INFORMATION SCIENCES, no 6, of SCHOOL OF INFORMATION SCIENCES, UNIVERSITY OF TAMPERE -
Decidability of uniform recurrence of morphic sequences
International audience -
A Primitive Recursive Algorithm for the General Petri Net Reachability Problem
The general Petri net reachability problem is shown to be decidable in double exponential space. The previous algorithm is non-primitive recursive. -
The Mortality of a Pair of 2x2 Matrices is Decidable
A pair of matrices is said to be mortal if there is a serie of these matrices for which the product is the null matrix. A recent result have established that the... -
Halting Problem for One-State Turing Machines
In [1], Turing has established the well-known result of the indecidability of the general halting problem of Turing machines. It is also well known that there exists... -
Decidability of All Minimal Models (Revised Version - 2012)
This unpublished note is an alternate, shorter (and hopefully more readable) proof of the decidability of all minimal models. The decidability follows from a proof of... -
Decidability of the HD0L ultimate periodicity problem
International audience -
Automated Synthesis of a Finite Complexity Ordering for Saturation
We present in this paper a new procedure to saturate a set of clauses with respect to a well-founded ordering on ground atoms such that A < B implies Var(A) ⊆... -
Unification modulo Synchronous Distributivity
International audience -
Unification modulo ACUI plus Distributivity Axioms
E-unification problems are central in automated deduction. In this work, we consider unification modulo theories that extend the well-known ACI or ACUI, by adding a... -
How Useful are Dag Automata?
25 pages -
Matrix semigroups and applications
We study matrix semigroups with different point of view that overlaps. The growth point of view seems to be related with the geometric point of view : we partially... -
Stochastic Cellular Automata: Correlations, Decidability and Simulations
This paper introduces a simple formalism for dealing with deterministic, non- deterministic and stochastic cellular automata in an unified and composable manner. This... -
Modal Logic of Time Division
This dataset has no description
-
Kiabora: An Analyzer of Existential Rule Bases
International audience -
Kleene Algebra with Converse
International audience -
E-unification by means of tree tuple synchronized grammars
International audience -
Unification in Extensions of Shallow Equational Theories
Rapport interne. -
Finiteness Theorems for Graphs and Posets Obtained by Compositions
Article dans revue scientifique avec comité de lecture.
