scientific article; zbMATH DE number 4049047
From MaRDI portal
Publication:3785940
Recommendations
- Unions of disjoint NP-complete sets
- Unions of disjoint NP-complete sets
- An algorithm for general set unification and its complexity
- Certain NP-complete matching problems
- Complexity of nilpotent unification and matching problems.
- The complexity of unions of disjoint sets
- The Complexity of Unions of Disjoint Sets
- Parameterized complexity of perfectly matched sets
- Complexity of Recognizing Equal Unions in Families of Sets
- scientific article; zbMATH DE number 3921983
Cited in
(31)- Complexity of matching problems
- Implication of clauses is undecidable
- AC-unification race: The system solving approach, implementation and benchmarks
- Intractable unifiability problems and backtracking
- The STO problem is NP-complete
- A term equality problem equivalent to graph isomorphism
- Computing answers with model elimination
- NP-completeness of small conflict set generation for congruence closure
- Complexity of nilpotent unification and matching problems.
- The STO-problem is NP-hard
- Default reasoning by deductive planning
- Probabilistic inductive constraint logic
- An efficient labelled nested multiset unification algorithm
- A formalisation of nominal C-matching through unification with protected variables
- Efficient instance retrieval with standard and relational path indexing
- A rewrite framework for language definitions and for generation of efficient interpreters
- Une procédure de décision pour un problème de satisfiabilité dans un univers ensembliste héréditairement fini
- Unification and matching modulo nilpotence
- scientific article; zbMATH DE number 1929957 (Why is no real title available?)
- Simple and Efficient Clause Subsumption with Feature Vector Indexing
- Frequency-based similarity for parameterized sequences: formal framework, algorithms, and applications
- Formalising nominal C-unification generalised with protected variables
- Extensions of unification modulo ACUI
- The complexity of counting problems in equational matching
- Rewriting Techniques and Applications
- Equality of terms containing associative-commutative functions and commutative binding operators is isomorphism complete
- SAT-Based Subsumption Resolution
- Interval propagation to reason about sets: Definition and implementation of a practical language
- Removing redundancy from a clause
- Complexity of unification problems with associative-commutative operators
- SAT solving for variants of first-order subsumption
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3785940)
