Pages that link to "Item:Q3585163"
From MaRDI portal
The following pages link to A decidable subclass of finitary programs (Q3585163):
Displaying 4 items.
- A “Conservative” Approach to Extending Answer Set Programming with Non-Herbrand Functions (Q2900504) (← links)
- Terminating Evaluation of Logic Programs with Finite Three-Valued Models (Q2946744) (← links)
- Constraint Answer Set Programming without Grounding (Q4559798) (← links)
- <tt>ASPeRiX</tt>, a first-order forward chaining approach for answer set computing (Q4593088) (← links)
