Pages that link to "Item:Q2931278"

The following pages link to Anytime Computation of Cautious Consequences in Answer Set Programming (Q2931278):

Displaying 14 items.

• Paracoherent answer set computation (Q2238696) (← links)
• Supportedly stable answer sets for logic programs with generalized atoms (Q2360180) (← links)
• Enumeration of minimal models and MUSes in WASP (Q2694547) (← links)
• Advances in WASP (Q3449189) (← links)
• The Design of the Sixth Answer Set Programming Competition (Q3449235) (← links)
• Cautious reasoning in ASP via minimal models and unsatisfiable cores (Q4559795) (← links)
• Ticker: A system for incremental ASP-based stream reasoning (Q4592708) (← links)
• Rewriting recursive aggregates in answer set programming: back to monotonicity (Q4592997) (← links)
• Complexity and compilation of GZ-aggregates in answer set programming (Q4592998) (← links)
• Taming primary key violations to query large inconsistent data via ASP (Q4593009) (← links)
• Anytime answer set optimization via unsatisfiable core shrinking (Q4593041) (← links)
• Enhancing Magic Sets with an Application to Ontological Reasoning (Q5108494) (← links)
• Abstract Solvers for Computing Cautious Consequences of ASP programs (Q5108499) (← links)
• ASP and subset minimality: enumeration, cautious reasoning and MUSes (Q6103676) (← links)