Pages that link to "Item:Q2900547"
From MaRDI portal
The following pages link to Connecting First-Order ASP and the Logic FO(ID) through Reducts (Q2900547):
Displaying 12 items.
- What is answer set programming to propositional satisfiability (Q1699519) (← links)
- Vicious circle principle, aggregates, and formation of sets in ASP based languages (Q2321320) (← links)
- Infinitary equilibrium logic and strongly equivalent logic programs (Q2407875) (← links)
- Semantics for conditional literals via the SM operator (Q2694573) (← links)
- Infinitary Equilibrium Logic and Strong Equivalence (Q3449222) (← links)
- On equivalence of infinitary formulas under the stable model semantics (Q4592970) (← links)
- An infinitary encoding of temporal equilibrium logic (Q4593006) (← links)
- <tt>ASPeRiX</tt>, a first-order forward chaining approach for answer set computing (Q4593088) (← links)
- Strong Equivalence of Logic Programs with Counting (Q5038462) (← links)
- Relating Two Dialects of Answer Set Programming (Q5108518) (← links)
- Verifying Tight Logic Programs with anthem and vampire (Q5140011) (← links)
- Here and There with Arithmetic (Q6063863) (← links)
