Pages that link to "Item:Q1924779"
From MaRDI portal
The following pages link to Complexity and undecidability results for logic programming (Q1924779):
Displaying 18 items.
- Some undecidable properties of SOS specifications (Q511941) (← links)
- Bounded nondeterminism of logic programs (Q702093) (← links)
- Circumscribing DATALOG: expressive power and complexity (Q1127538) (← links)
- Expressive power and complexity of partial models for disjunctive deductive databases (Q1274974) (← links)
- Generalized disjunctive well-founded semantics for logic programs. (Q1354026) (← links)
- Abduction from logic programs: Semantics and complexity (Q1389684) (← links)
- Monadic logic programs and functional complexity (Q1392280) (← links)
- Active integrity constraints for general-purpose knowledge bases (Q1783734) (← links)
- The expressive powers of the logic programming semantics (Q1900917) (← links)
- Complexity of computing with extended propositional logic programs (Q1924783) (← links)
- A connection between the Cantor-Bendixson derivative and the well-founded semantics of finite logic programs (Q1926591) (← links)
- Logic programming: laxness and saturation (Q1994355) (← links)
- (Q3681934) (← links)
- (Q3827989) (← links)
- (Q4029601) (← links)
- The complexity of revising logic programs (Q4262832) (← links)
- (Q4325363) (← links)
- The expressive power of revised Datalog on problems with closure properties (Q6562535) (← links)