Pages that link to "Item:Q3125898"
From MaRDI portal
The following pages link to Efficient top-down computation of queries under the well-founded semantics (Q3125898):
Displayed 14 items.
- Enhancing global SLS-resolution with loop cutting and tabling mechanisms (Q703484) (← links)
- Integrating answer set programming and constraint logic programming (Q1028649) (← links)
- Disjunctive logic and semantics of disjunctive logic programs (Q1368240) (← links)
- Logic programming and knowledge representation---The A-Prolog perspective (Q1603731) (← links)
- Dynamic reordering of alternatives for definite logic programs (Q1749236) (← links)
- Termination of logic programs with imperfect information: applications and query procedure (Q2372195) (← links)
- Logic programming with solution preferences (Q2378282) (← links)
- A rule based knowledge transaction model for mobile environments (Q2509213) (← links)
- Nonmonotonic Trust Management for P2P Applications (Q2804936) (← links)
- Compacting Boolean Formulae for Inference in Probabilistic Logic Programming (Q3449226) (← links)
- Probabilistic reasoning with answer sets (Q3612603) (← links)
- An abstract machine for fixed-order dynamically stratified programs (Q4647532) (← links)
- Inference with Logic Programs with Annotated Disjunctions under the Well Founded Semantics (Q5504688) (← links)
- A sound and complete procedure for a general logic program in non-floundering derivations with respect to the 3-valued stable model semantics (Q5958767) (← links)