Decomposable theories

DOI10.1017/S1471068406002997zbMath1129.03016MaRDI QIDQ5309080

Khalil Djelloul

Publication date: 9 October 2007

Published in: Theory and Practice of Logic Programming (Search for Journal in Brave)

zbMATH Keywords

rewriting rulesfirst-order formulas

Mathematics Subject Classification ID

Logic in computer science (03B70) Grammars and rewriting systems (68Q42) Logic programming (68N17)

Related Items (4)

An Efficient Decision Procedure for Functional Decomposable Theories Based on Dual Constraints ⋮ A full first-order constraint solver for decomposable theories ⋮ From decomposable to residual theories ⋮ A Full First-Order Constraint Solver for Decomposable Theories

Cites Work

• Fundamental properties of infinite trees
• Equivalences and transformations of regular systems - applications to recursive program schemes and grammars
• Linear unification
• Expressiveness of full first-order constraints in the algebra of finite or infinite trees
• A decision procedure for term algebras with queues
• Negation in logic programming
• An Efficient Unification Algorithm
• A Machine-Oriented Logic Based on the Resolution Principle

This page was built for publication: Decomposable theories