IASCAR: incremental answer set counting by anytime refinement

Cites Work

Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
ASSAT: computing answer sets of a logic program by SAT solvers
A generalization of the Lin-Zhao theorem
BPP and the polynomial hierarchy
The relationship between stable, supported, default and autoepistemic semantics for general logic programs
The polynomial-time hierarchy
Conflict-driven answer set solving: from theory to practice
Logic programs with stable model semantics as a constraint programming paradigm
Design and results of the second international competition on computational models of argumentation
On preprocessing techniques and their impact on propositional model counting
The design of the Seventh Answer Set Programming Competition
Answer set solving with bounded treewidth revisited
Treewidth-aware reductions of normal \textsc{ASP} to \textsc{SAT} - is normal \textsc{ASP} Harder than \textsc{SAT} after all?
Tunas -- fishing for diverse answer sets: a multi-shot trade up strategy
IASCAR: incremental answer set counting by anytime refinement
A practical account into counting Dung's extensions by dynamic programming
Handbook of automated reasoning. In 2 vols
Controlling a solver execution with the runsolver Tool
Trichotomy and dichotomy results on the complexity of reasoning with disjunctive logic programs
Answer Set Programming and Planning with Knowledge and World-Altering Actions in Multiple Agent Domains
Compact Translations of Non-disjunctive Answer Set Programs to Propositional Clauses
PP is as Hard as the Polynomial-Time Hierarchy
Some (in)translatability results for normal logic programs and propositional theories
Knowledge Representation, Reasoning and Declarative Problem Solving
On the Tractable Counting of Theory Models and its Application to Truth Maintenance and Belief Revision
Inference and learning in probabilistic logic programs using weighted Boolean formulas
Knowledge compilation of logic programs using approximation fixpoint theory
Utilizing Treewidth for Quantitative Reasoning on Epistemic Logic Programs
Logic Programming
Rewriting optimization statements in answer-set programs
Why are there so many loop formulas?
Space/time trade-offs in hash coding with allowable errors
Exploiting Database Management Systems and Treewidth for Counting
ASP and subset minimality: enumeration, cautious reasoning and MUSes
Proof complexity of propositional model counting
Certified knowledge compilation with application to verified model counting

This page was built for publication: IASCAR: incremental answer set counting by anytime refinement

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6656460)