Pages that link to "Item:Q5096296"
From MaRDI portal
The following pages link to Constraints in Computational Logics (Q5096296):
Displayed 20 items.
- Local simplification (Q5096297) (← links)
- Simplifying clausal satisfiability problems (Q5096298) (← links)
- Ordered Binary Decision Diagrams and the Davis-Putnam procedure (Q5096299) (← links)
- A foundation for higher-order concurrent constraint programming (Q5096300) (← links)
- Constraints for polymorphic behaviours of concurrent ML (Q5096301) (← links)
- A confluent relational calculus for higher-order programming with constraints (Q5096302) (← links)
- Modular AC unification of higher-order patterns (Q5096303) (← links)
- Higher order disunification: Some decidable cases (Q5096304) (← links)
- “Syntactic” AC-unification (Q5096305) (← links)
- Repeated redundant inequalities in constraint logic programming (Q5096306) (← links)
- An efficient algorithm of logic programming with constraint hierarchy (Q5096308) (← links)
- Path consistency in clp(FD) (Q5096309) (← links)
- A record calculus with principal types (Q5096310) (← links)
- On modularity in term rewriting and narrowing (Q5096311) (← links)
- Higher order conditional rewriting and narrowing (Q5096313) (← links)
- Buchberger's algorithm: A constraint-based completion procedure (Q5096314) (← links)
- Set constraints in some equational theories (Q5096315) (← links)
- How to win a game with features (Q5096316) (← links)
- Some new decidability results on positive and negative set constraints (Q5096317) (← links)
- Solving simplification ordering constraints (Q5096318) (← links)
