Records for logic programming
From MaRDI portal
Publication:4290618
Recommendations
Cited in
(21)- Constructing infinitary quotient-inductive types
- Logics for unordered trees with data constraints
- Situated simplification
- Dominance constraints with Boolean connectives: A model-eliminative treatment
- A foundation for higher-order concurrent constraint programming
- How to win a game with features
- A rational reconstruction of the domain of feature structures
- Regular path expressions in feature logic
- Combination of constraint systems II: Rational amalgamation
- How to win a game with features
- A new generic scheme for functional logic programming with constraints
- Combination of constraint solvers for free and quasi-free structures
- An improved lower bound for the elementary theories of trees
- Theories with the independence property
- Type inference for first-class messages with feature constraints
- Ordering constraints over feature trees expressed in second-order monadic logic.
- Equational and membership constraints for infinite trees
- Set constraints with intersection
- Automata for unordered trees
- Finite-tree analysis for constraint logic-based languages
- A complete and recursive feature theory
This page was built for publication: Records for logic programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4290618)