Manipulating tree tuple languages by transforming logic programs
From MaRDI portal
Recommendations
Cites work
- Alternating two-way AC-tree automata
- Decision procedures and model building or how to improve logical information in automated deduction
- Higher-order positive set constraints
- scientific article; zbMATH DE number 3872640 (Why is no real title available?)
- scientific article; zbMATH DE number 1375572 (Why is no real title available?)
- scientific article; zbMATH DE number 475424 (Why is no real title available?)
- scientific article; zbMATH DE number 1158762 (Why is no real title available?)
- scientific article; zbMATH DE number 1919508 (Why is no real title available?)
- Hyperresolution and automated model building
- Set constraints and automata
- Synchronized tree languages revisited and new applications
Cited in
(2)
This page was built for publication: Manipulating tree tuple languages by transforming logic programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4916223)