Search results for "undecidability"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
11	Helko Lehmann, Michael Leuschel	Solving Planning Problems by Partial Deduction.	LPAR	2000	DBLP DOI BibTeX RDF
11	Joseph S. Miller	Decidability and Complexity Results for Timed Automata and Semi-linear Hybrid Automata.	HSCC	2000	DBLP DOI BibTeX RDF
11	Olivier Ly	Automatic Graphs and Graph D0L-Systems.	MFCS	2000	DBLP DOI BibTeX RDF
11	Kristofer Johannisson	Formalizing the Halting Problem in a Constructive Type Theory.	TYPES	2000	DBLP DOI BibTeX RDF
11	Paliath Narendran, Michaël Rusinowitch	The Theory of Total Unary RPO Is Decidable.	Computational Logic	2000	DBLP DOI BibTeX RDF	recursive path ordering, ground reducibility, ordered rewriting, tree automata, first-order theory
11	Holger Sturm, Nobu-Yuki Suzuki, Frank Wolter, Michael Zakharyaschev	Semi-qualitative Reasoning about Distances: A Preliminary Report.	JELIA	2000	DBLP DOI BibTeX RDF
11	Pedro J. Martín, Antonio Gavilanes	Simultaneous Rigid Sorted Unification.	JELIA	2000	DBLP DOI BibTeX RDF
11	Richard Statman	On the Word Problem for Combinators.	RTA	2000	DBLP DOI BibTeX RDF
11	Ken-etsu Fujita, Aleksy Schubert	Partially Typed Terms between Church-Style and Curry-Style.	IFIP TCS	2000	DBLP DOI BibTeX RDF
11	James Bailey 0001, Guozhu Dong	Decidability of First-Order Logic Queries over Views.	ICDT	1999	DBLP DOI BibTeX RDF
11	Rajeev Alur, Mihalis Yannakakis	Model Checking of Message Sequence Charts.	CONCUR	1999	DBLP DOI BibTeX RDF
11	Anne-Cécile Caron, Franck Seynhaeve, Sophie Tison, Marc Tommasi	Deciding the Satisfiability of Quantifier free Formulae on One-Step Rewriting.	RTA	1999	DBLP DOI BibTeX RDF
11	Martin Fränzle	Analysis of Hybrid Systems: An Ounce of Realism Can Save an Infinity of States.	CSL	1999	DBLP DOI BibTeX RDF
11	Carlos Areces, Patrick Blackburn, Maarten Marx	A Road-Map on Complexity for Hybrid Logics.	CSL	1999	DBLP DOI BibTeX RDF	Labeled Deduction, Computational Complexity, Description Logic, Modal and Temporal Logic
11	Peter Buneman, Wenfei Fan, Scott Weinstein	Query Optimization for Semistructured Data Using Path Constraints in a Deterministic Data Model.	DBPL	1999	DBLP DOI BibTeX RDF
11	Petr Jancar, Faron Moller, Zdenek Sawa	Simulation Problems for One-Counter Machines.	SOFSEM	1999	DBLP DOI BibTeX RDF
11	Carlo Toffalori	The decision problem for [(Z)\vec]C(p3){\vec Z}C(p^3)-lattices with pp prime.	Arch. Math. Log.	1998	DBLP DOI BibTeX RDF	Mathematics Subject Classification (1991):03C60, 03B25
11	Abbas Edalat, Peter John Potts, Philipp Sünderhauf	Lazy Computation with Exact Real Numbers.	ICFP	1998	DBLP DOI BibTeX RDF
11	Harald Ganzinger, Florent Jacquemard, Margus Veanes	Rigid Reachability.	ASIAN	1998	DBLP DOI BibTeX RDF
11	Jacques Mazoyer, Ivan Rapaport	Inducing an Order on Cellular Automata by a Grouping Operation.	STACS	1998	DBLP DOI BibTeX RDF
11	Jürgen Dassow	Some Remarks on Networks of Parallel Language Processors.	Rough Sets and Current Trends in Computing	1998	DBLP DOI BibTeX RDF
11	Rakesh M. Verma, Michaël Rusinowitch, Denis Lugiez	Algorithms and Reductions for Rewriting Problems.	RTA	1998	DBLP DOI BibTeX RDF
11	Anatoli Degtyarev, Yuri Gurevich, Paliath Narendran, Margus Veanes, Andrei Voronkov	The Decidability of Simultaneous Rigid E-Unification with One Variable.	RTA	1998	DBLP DOI BibTeX RDF
11	Manoranjan Satpathy, Dang Van Hung, Paritosh K. Pandya	Some Decidability Results for Duration Calculus under Synchronous Interpretation.	FTRTFT	1998	DBLP DOI BibTeX RDF
11	Bernhard K. Aichernig, Peter Gorm Larsen	A Proof Obligation Generator for VDM-SL.	FME	1997	DBLP DOI BibTeX RDF
11	Franck Seynhaeve, Marc Tommasi, Ralf Treinen	Grid Structure and Undecidable Constraint Theories.	TAPSOFT	1997	DBLP DOI BibTeX RDF
11	Paliath Narendran, Friedrich Otto	The Word Matching Problem Is Undecidable For Finite Special String-Rewriting Systems That Are Confluent.	ICALP	1997	DBLP DOI BibTeX RDF	matching, unification, equational theory, string-rewriting systems
11	Jérôme Olivier Durand-Lose	Intrinsic Universality of a 1-Dimensional Reversible Cellular Automaton.	STACS	1997	DBLP DOI BibTeX RDF
11	Friedrich Otto	On the Property of Preserving Regularity for String-Rewriting Systems.	RTA	1997	DBLP DOI BibTeX RDF
11	Heinz Faßbender, Sebastian Maneth	A Strict Border for the Decidability of E-Unification for Recursive Functions.	ALP	1996	DBLP DOI BibTeX RDF
11	Anatoli Degtyarev, Andrei Voronkov	What You Always Wanted to Know About Rigid E-Unification.	JELIA	1996	DBLP DOI BibTeX RDF
11	Florent Jacquemard	Decidable Approximations of Term Rewriting Systems.	RTA	1996	DBLP DOI BibTeX RDF
11	Kai Salomaa	Decidability of Equivalence for Deterministic Synchronized Tree Automata.	TAPSOFT	1995	DBLP DOI BibTeX RDF
11	Parosh Aziz Abdulla, Mats Kindahl	Decidability of Simulation and Bisimulation between Lossy Channel Systems and Finite State Systems (Extended Abstract).	CONCUR	1995	DBLP DOI BibTeX RDF
11	Farn Wang, Aloysius K. Mok	RTL and Refutation by Positive Cycles.	FME	1994	DBLP DOI BibTeX RDF
11	Karlis Cerans	Deciding Properties of Integral Relational Automata.	ICALP	1994	DBLP DOI BibTeX RDF
11	Inderpal Singh Mumick, Oded Shmueli	Universal Finiteness and Satisfiability.	PODS	1994	DBLP DOI BibTeX RDF	SQL, Datalog
11	Petr Jancar	Decidability Questions for Bismilarity of Petri Nets and Some Related Problems.	STACS	1994	DBLP DOI BibTeX RDF
11	Hubert Comon, Ralf Treinen	Ordering Constraints on Trees.	CAAP	1994	DBLP DOI BibTeX RDF
11	Rolf Socher-Ambrosius	Unification in Order-Sorted Logic With Term Declarations.	LPAR	1993	DBLP DOI BibTeX RDF
11	Christian G. Fermüller, Gernot Salzer	Ordered Paramodulation and Resolution as Decision Procedure.	LPAR	1993	DBLP DOI BibTeX RDF
11	Alan Mycroft	Completeness and predicate-based abstract interpretation.	PEPM	1993	DBLP DOI BibTeX RDF
11	Philippe Devienne, Patrick Lebègue, Jean-Christophe Routier	Halting Problem of One Binary Horn Clause is Undecidable.	STACS	1993	DBLP DOI BibTeX RDF
11	Aart Middeldorp, Bernhard Gramlich	Simple Termination is Difficult.	RTA	1993	DBLP DOI BibTeX RDF
11	Y. S. Ramakrishna, Laura K. Dillon, Louise E. Moser, P. M. Melliar-Smith, George Kutty	A Real-Time Interval Logic and Its Decision Procedure.	FSTTCS	1993	DBLP DOI BibTeX RDF
11	Hava T. Siegelmann, Eduardo D. Sontag	On the Computational Power of Neural Nets.	COLT	1992	DBLP DOI BibTeX RDF
11	Anne-Cécile Caron	Linear Bounded Automata and Rewrite Systems: Influence of Initial Configurations on Decision Properties.	TAPSOFT, Vol.1	1991	DBLP DOI BibTeX RDF
11	Max Dauchet	Simulation of Turning Machines by a Left-Linear Rewrite Rule.	RTA	1989	DBLP DOI BibTeX RDF
11	Conal Elliott	Higher-order Unification with Dependent Function Types.	RTA	1989	DBLP DOI BibTeX RDF
11	Volker Diekert, Axel Möbus	Hotz-Isomorphism Theorems in Formal Language Theory.	STACS	1988	DBLP DOI BibTeX RDF
11	Erich Grädel	Size of Models versus Length of Computations: On Inseparability by Nondeterministic Time Complexity Classes.	CSL	1988	DBLP DOI BibTeX RDF
11	Yuri Gurevich, Harry R. Lewis	The Inference Problem for Template Dependencies.	PODS	1982	DBLP DOI BibTeX RDF
11	Timothy A. Budd, Richard A. DeMillo, Richard J. Lipton, Frederick G. Sayward	Theoretical and Emperical Studies on Using Program Mutation to Test the Functional Correctness of Programs.	POPL	1980	DBLP DOI BibTeX RDF
11	Philip K. Hooper	Monogenic Post Normal Systems of Arbitrary Degree.	J. ACM	1966	DBLP DOI BibTeX RDF