Results 41 to 50 of about 494,097 (364)
The Polyhedron-Hitting Problem [PDF]
, 2014 We consider polyhedral versions of Kannan and Lipton's Orbit Problem (STOC '80 and JACM '86)---determining whether a target polyhedron V may be reached from a starting point x under repeated applications of a linear transformation A in an ambient vector ...
Chonev, Ventsislav +2 more
core +2 more sources
Decidability and Undecidability Results for Propositional Schemata [PDF]
Journal of Artificial Intelligence Research, 2014 We define a logic of propositional formula schemata adding to the syntax of propositional logic indexed propositions (e.g., pi) and iterated connectives ∨ or ∧ ranging over intervals parameterized by arithmetic variables (e.g., ∧i-1n pi, where n is a ...
Vincent Aravantinos +2 more
semanticscholar +1 more source
Trees over Infinite Structures and Path Logics with Synchronization [PDF]
Electronic Proceedings in Theoretical Computer Science, 2011 We provide decidability and undecidability results on the model-checking problem for infinite tree structures. These tree structures are built from sequences of elements of infinite relational structures.
Alex Spelten +2 more
doaj +1 more source
The Complexity of Combinations of Qualitative Constraint Satisfaction Problems [PDF]
Logical Methods in Computer Science, 2020 The CSP of a first-order theory $T$ is the problem of deciding for a given finite set $S$ of atomic formulas whether $T \cup S$ is satisfiable. Let $T_1$ and $T_2$ be two theories with countably infinite models and disjoint signatures.
Manuel Bodirsky, Johannes Greiner
doaj +1 more source
An Optimal Decision Procedure for MPNL over the Integers [PDF]
, 2011 Interval temporal logics provide a natural framework for qualitative and quantitative temporal reason- ing over interval structures, where the truth of formulae is defined over intervals rather than points.
Angelo Montanari +19 more
core +3 more sources
Decidability of higher-order matching [PDF]
Logical Methods in Computer Science, 2009 We show that the higher-order matching problem is decidable using a game-theoretic argument.
Colin Stirling
doaj +1 more source
Lengths May Break Privacy – Or How to Check for Equivalences with Length [PDF]
, 2013 Security protocols have been successfully analyzed using symbolic models, where messages are represented by terms and protocols by processes. Privacy properties like anonymity or untraceability are typically expressed as equivalence between processes ...
A. Armando +4 more
core +4 more sources
Decidability of second-order theories and automata on infinite trees
, 1968 Introduction. In this paper we solve the decision problem of a certain secondorder mathematical theory and apply it to obtain a large number of decidability results.
M. Rabin
semanticscholar +1 more source
Decidability of Intelligent Systems [PDF]
حکمت و فلسفه, 2008 Intelligent systems are designed on the model of the operation of mind; but they come across, at least, the following problems: (a) Can IS solve every problem?
mohammad ali hijjati +1 more
doaj +1 more source
On the (un)decidability of a near-unanimity term [PDF]
, 2007 We investigate the near-unanimity problem: given a finite algebra, decide if it has a near-unanimity term of finite arity. We prove that it is undecidable of a finite algebra if it has a partial near-unanimity term on its underlying set excluding two ...
Maróti, Miklós
core +1 more source