Pages that link to "Item:Q3474909"

The following pages link to Some computational aspects of circumscription (Q3474909):

Displaying 14 items.

• On the tractability of minimal model computation for some CNF theories (Q490649) (← links)
• Recursively indefinite databases (Q688672) (← links)
• Reconsideration of circumscriptive induction with pointwise circumscription (Q833732) (← links)
• Reasoning with minimal models: efficient algorithms and applications (Q1127346) (← links)
• The complexity of model checking for circumscriptive formulae (Q1205713) (← links)
• The complexity of propositional closed world reasoning and circumscription (Q1329160) (← links)
• On compact representations of propositional circumscription (Q1391128) (← links)
• Graph-based construction of minimal models (Q2093381) (← links)
• Annotation theories over finite graphs (Q2269516) (← links)
• Propositional circumscription and extended closed-world reasoning are \(\Pi_ 2^ P\)-complete (Q2367539) (← links)
• An incremental algorithm for generating all minimal models (Q2457647) (← links)
• An extension of pointwise circumscription (Q2676573) (← links)
• The Model Checking Problem for Prefix Classes of Second-Order Logic: A Survey (Q3586006) (← links)
• Conservative query normalization on parallel circumscription (Q5210781) (← links)