Pages that link to "Item:Q5278207"

The following pages link to Expressiveness of Logic Programs under the General Stable Model Semantics (Q5278207):

Displaying 13 items.

• Ordered completion for first-order logic programs on finite structures (Q420824) (← links)
• A note on the stable model semantics for logic programs (Q1127348) (← links)
• The expressive powers of stable models for bound and unbound DATALOG queries (Q1362337) (← links)
• Logic programs with stable model semantics as a constraint programming paradigm (Q1978008) (← links)
• Characterizations of stable model semantics for logic programs with arbitrary constraint atoms (Q3183130) (← links)
• On the existence of stable models of non-stratified logic programs (Q3426203) (← links)
• Some (in)translatability results for normal logic programs and propositional theories (Q3647255) (← links)
• (Q3983046) (← links)
• Expressiveness of stable model semantics for disjunctive logic programs with functions (Q4371993) (← links)
• Stable-unstable semantics: Beyond NP with normal logic programs (Q4593043) (← links)
• Extending Logic Programming with Labelled Variables: Model and Semantics (Q4686514) (← links)
• On the expressibility of stable logic programming (Q4815033) (← links)
• (Q5445168) (← links)