Pages that link to "Item:Q5398066"
From MaRDI portal
The following pages link to A Tarskian Informal Semantics for Answer Set Programming (Q5398066):
Displaying 13 items.
- On abstract modular inference systems and solvers (Q286083) (← links)
- A progression semantics for first-order logic programs (Q1680677) (← links)
- What is answer set programming to propositional satisfiability (Q1699519) (← links)
- Connecting First-Order ASP and the Logic FO(ID) through Reducts (Q2900547) (← links)
- Knowledge compilation of logic programs using approximation fixpoint theory (Q4592990) (← links)
- Semantics of templates in a compositional framework for building logics (Q4593008) (← links)
- Predicate logic as a modeling language: modeling and solving some machine learning and data mining problems with<i>IDP3</i> (Q4593015) (← links)
- Stable-unstable semantics: Beyond NP with normal logic programs (Q4593043) (← links)
- First-order modular logic programs and their conservative extensions (Q4593056) (← links)
- The KB paradigm and its application to interactive configuration (Q4593081) (← links)
- Beyond NP: Quantifying over Answer Sets (Q5108497) (← links)
- Modular Answer Set Programming as a Formal Specification Language (Q5140013) (← links)
- FOLASP<i>: FO(·) as Input Language for Answer Set Solvers</i> (Q6063868) (← links)
