The following pages link to On finitely recursive programs (Q3621269):
Displaying 8 items.
- Terminating Evaluation of Logic Programs with Finite Three-Valued Models (Q2946744) (← links)
- A decidable subclass of finitary programs (Q3585163) (← links)
- Disjunctive ASP with functions: Decidable queries and effective computation (Q3585164) (← links)
- Constraint Answer Set Programming without Grounding (Q4559798) (← 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)
- Well–definedness and efficient inference for probabilistic logic programming under the distribution semantics (Q5299588) (← links)
- Logic programming with function symbols: Checking termination of bottom-up evaluation through program adornments (Q5398308) (← links)
