A Sufficient Completeness Checker for Linear Order-Sorted Specifications Modulo Axioms

No abstract is available for this paper.

• Publication year

  2006

• Venue

  International Joint Conference on Automated Reasoning

• Publication date

  2006-08-17

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1007/11814771_14
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Automatic Verification of Sufficient Completeness for Conditional Constrained Term Rewriting Systems

  2006cited by this paper
• Propositional Tree Automata

  2006cited by this paper
• ACTAS : A System Design for Associative and Commutative Tree Automata Theory

  2005cited by this paper
• Sufficient Completeness Checking with Propositional Tree Automata

  2005cited by this paper
• A Sufficient Completeness Reasoning Tool for Partial Specifications

  2005cited by this paper
• Equational rules for rewriting logic

  2002cited by this paper
• Decidability and Closure Properties of Equational Tree Languages

  2002cited by this paper
• Algebraic specification of abstract data types

  2001cited by this paper
• Beyond Regularity: Equational Tree Automata for Associative and Commutative Theories

  2001cited by this paper
• Tree automata techniques and applications

  1997cited by this paper
• Ground reducibility is EXPTIME-complete

  1997cited by this paper
• Sufficient-completeness, ground-reducibility and their complexity

  1991cited by this paper
• On sufficient-completeness and related properties of term rewriting systems

  1987cited by this paper

• A Nominal Approach to Equational Problems in Languages with Binders

  2025cites this paper
• Symbolic Computation in Maude: Some Tapas

  2020cites this paper
• Technical Report: Initial Algebra Semantics in Matching Logic

  2020cites this paper
• Ground confluence of order-sorted conditional specifications modulo axioms

  2020cites this paper
• Rewriting Logic and Its Applications: 13th International Workshop, WRLA 2020, Virtual Event, October 20-22, 2020, Revised Selected Papers

  2020cites this paper
• Verification of the IBOS Browser Security Properties in Reachability Logic

  2020cites this paper
• Symbolic Reasoning Methods in Rewriting Logic and Maude

  2018cites this paper
• Variant-Based Decidable Satisfiability in Initial Algebras with Predicates

  2017cites this paper
• Metalevel Algorithms for Variant Satisfiability

  2016cites this paper
• On First-Order Model-Based Reasoning

  2015cites this paper
• Two Decades of Maude

  2015cites this paper
• Variant-Based Satisfiability in Initial Algebras

  2015cites this paper
• Set Theory and Algebra in Computer Science A Gentle Introduction to Mathematical Modeling

  2013cites this paper
• Rewriting logic bibliography by topic: 1990-2011

  2012cites this paper
• Depuración declarativa y verificación heterogénea en Maude = Declarative debugging and heterogeneous verification in Maude

  2011cites this paper
• Research Visit at the University of Illinois at Urbana-Champaign: End Report

  2011cites this paper
• Incremental checking of well-founded recursive specifications modulo axioms

  2011cites this paper
• Towards a Maude Formal Environment

  2011cites this paper
• Enhancing the Debugging of Maude Specifications

  2010cites this paper
• Completeness of Unfolding for Rewriting Logic Theories

  2010cites this paper
• A Church-Rosser Checker Tool for Conditional Order-Sorted Equational Maude Specifications

  2010cites this paper
• Coverset Induction with Partiality and Subsorts: A Powerlist Case Study

  2010cites this paper
• A fold/unfold transformation framework for rewrite theories extended to CCT

  2010cites this paper
• A Fold/Unfold Transformation Framework for Rewrite Theories and its Application to CCT Technical Report

  2010cites this paper
• Twenty years of rewriting logic

  2010influential citation
• Order-Sorted Parameterization and Induction

  2009cites this paper
• Decision Procedures for Equationally Based Reasoning

  2008influential citation
• Combining Equational Tree Automata over AC and ACI Theories

  2008cites this paper
• Knowledge Representation and Classical Logic

  2008cites this paper
• Languages Modulo Normalization

  2007cites this paper
• On the Completeness of Context-Sensitive Order-Sorted Specifications

  2007influential citation
• The Temporal Logic of Rewriting: A Gentle Introduction

  2007cites this paper
• Maude's module algebra

  2007cites this paper
• The Maude Formal Tool Environment

  2007influential citation
• Sufficient Completeness Checking with Propositional Tree Automata

  2005cites this paper
• Handbook of Knowledge Representation Edited Knowledge Representation and Classical Logic

  year unknowncites this paper