Pages that link to "Item:Q5325773"

The following pages link to One More Decidable Class of Finitely Ground Programs (Q5325773):

Displaying 10 items.

• Domain expansion for ASP-programs with external sources (Q254002) (← links)
• Bringing existential variables in answer set programming and bringing non-monotony in existential rules: two sides of the same coin (Q1653439) (← links)
• Pruning external minimality checking for answer set programs using semantic dependencies (Q2046045) (← links)
• The Intelligent Grounder of DLV (Q2900523) (← links)
• Terminating Evaluation of Logic Programs with Finite Three-Valued Models (Q2946744) (← links)
• Checking termination of bottom-up evaluation of logic programs with function symbols (Q4593017) (← links)
• Using linear constraints for logic program termination analysis (Q4593032) (← links)
• <tt>ASPeRiX</tt>, a first-order forward chaining approach for answer set computing (Q4593088) (← links)
• ASP (): Answer Set Programming with Algebraic Constraints (Q5140023) (← links)
• Index Sets for Finite Normal Predicate Logic Programs with Function Symbols (Q5283418) (← links)