scientific article; zbMATH DE number 176121

MaRDI QIDQ4035222zbMATH OpenFDO

Authors Jean-Louis Lassez, Michael J. Maher, Kim Marriott

Publication date 18 May 1993

zbMATH Keywords

abstract data typeseliminating negationlearningrewriting systemsunification

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42) Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• scientific article; zbMATH DE number 1670857
• The negation elimination from syntactic equational formula is decidable
• Negation elimination in empty or permutative theories
• scientific article; zbMATH DE number 4092755
• Negation elimination in equational formulae (extended abstract)

Cited in

(16)

• On the complexity of equational problems in CNF
• On deciding subsumption problems
• Explicit versus implicit representations of subsets of the Herbrand universe.
• Working with ARMs: Complexity results on atomic representations of Herbrand models
• On inductive inference of cyclic structures
• Equational formulas and pattern operations in initial order-sorted algebras
• scientific article; zbMATH DE number 1670493 (Why is no real title available?)
• scientific article; zbMATH DE number 1670857 (Why is no real title available?)
• Speed-up techniques for negation in grounding
• The negation elimination from syntactic equational formula is decidable
• AC complement problems: Satisfiability and negation elimination
• Negation elimination in equational formulae (extended abstract)
• Equational formulas and pattern operations in initial order-sorted algebras
• Speeding up algorithms on atomic representations of Herbrand models via new redundancy criteria
• Anti-pattern templates
• Implementing constructive intensional negation

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 Q4035222)