Pages that link to "Item:Q1354033"
From MaRDI portal
The following pages link to Computational complexity and constraint logic programming languages (Q1354033):
Displaying 4 items.
- Generalized disjunctive well-founded semantics for logic programs. (Q1354026) (← links)
- Decidable \({\exists}^*{\forall}^*\) first-order fragments of linear rational arithmetic with uninterpreted predicates (Q2031420) (← links)
- Relative expressiveness of defeasible logics (Q4911149) (← links)
- From LP to LP: Programming with constraints (Q5096231) (← links)