Pages that link to "Item:Q814607"
From MaRDI portal
The following pages link to ASSAT: computing answer sets of a logic program by SAT solvers (Q814607):
Displaying 16 items.
- ASSAT (Q15063) (← links)
- Satisfiability checking in Łukasiewicz logic as finite constraint satisfaction (Q352963) (← links)
- Ordered completion for first-order logic programs on finite structures (Q420824) (← links)
- Stable models and circumscription (Q543596) (← links)
- Semantics and complexity of recursive aggregates in answer set programming (Q543600) (← links)
- Loop-separable programs and their first-order definability (Q543631) (← links)
- Weight constraint programs with evaluable functions (Q645084) (← links)
- The loop formula based semantics of description logic programs (Q764312) (← links)
- A generalization of the Lin-Zhao theorem (Q854963) (← links)
- Equilibrium logic (Q854969) (← links)
- Answer set programming based on propositional satisfiability (Q861709) (← links)
- Design and results of the Fifth Answer Set Programming Competition (Q899444) (← links)
- Evaluating ASP and commercial solvers on the CSPLib (Q1020490) (← links)
- On the relation among answer set solvers (Q1028643) (← links)
- Integrating answer set programming and constraint logic programming (Q1028649) (← links)
- Using answer set programming to deal with Boolean networks and attractor computation: application to gene regulatory networks of cells (Q6059225) (← links)
