The Model Counting Competition 2020 von Fichte, Johannes K., Hecher, Markus, Hamiti, Florim

Volltext

Treewidth-aware reductions of normal ASP to SAT – Is normal ASP harder than SAT after all? von Hecher, Markus

Volltext

DynASP2.5: Dynamic Programming on Tree Decompositions in Action von Fichte, Johannes K., Hecher, Markus, Morak, Michael, Woltran, Stefan

Volltext

Proceedings 38th International Conference on Logic Programming: Treewidth-aware Reductions of Normal ASP to SAT — Is Normal ASP Harder than SAT after All? (Extended Abstract) von Hecher, Markus

Volltext

aspmc: New frontiers of algebraic answer set counting von Eiter, Thomas, Hecher, Markus, Kiesel, Rafael

Volltext

Advanced Tools and Methods for Treewidth-Based Problem Solving von Hecher, M

Volltext

Default logic and bounded treewidth von Fichte, Johannes K., Hecher, Markus, Schindler, Irina

Volltext

Counting Complexity for Reasoning in Abstract Argumentation von Fichte, Johannes K., Hecher, Markus, Meier, Arne

Volltext

Utilizing Treewidth for Quantitative Reasoning on Epistemic Logic Programs von BESIN, VIKTOR, HECHER, MARKUS, WOLTRAN, STEFAN

Volltext

Structure-Guided Cube-and-Conquer for MaxSAT von Bannach, Max, Hecher, Markus

Volltext

Proceedings 39th International Conference on Logic Programming: Body-Decoupled Grounding via Solving: A Novel Approach on the ASP Bottleneck (Extended Abstract) von Besin, Viktor, Hecher, Markus, Woltran, Stefan

Volltext

Tight Double Exponential Lower Bounds von Bliznets, Ivan, Hecher, Markus

Volltext

Solving Projected Model Counting by Utilizing Treewidth and its Limits von Fichte, Johannes K., Hecher, Markus, Morak, Michael, Thier, Patrick, Woltran, Stefan

Volltext

IASCAR: Incremental Answer Set Counting by Anytime Refinement von FICHTE, JOHANNES K., GAGGL, SARAH ALICE, HECHER, MARKUS, RUSOVAC, DOMINIK

Volltext

Treewidth and Counting Projected Answer Sets von Fichte, Johannes K., Hecher, Markus

Volltext

Exploiting Database Management Systems and Treewidth for Counting von FICHTE, JOHANNES K., HECHER, MARKUS, THIER, PATRICK, WOLTRAN, STEFAN

Volltext

An SMT Approach to Fractional Hypertree Width von Fichte, Johannes K., Hecher, Markus, Lodha, Neha, Szeider, Stefan

Volltext

A Time Leap Challenge for SAT-Solving von Fichte, Johannes K., Hecher, Markus, Szeider, Stefan

Volltext

Characterizing Structural Hardness of Logic Programs: What makes Cycles and Reachability Hard for Treewidth? von Hecher, Markus

Volltext bestellen

Proceedings 38th International Conference on Logic Programming: ApproxASP - A Scalable Approximate Answer Set Counter (Extended Abstract) von Kabir, Mohimenul, Everardo, Flavio, Shukla, Ankit, Fichte, Johannes K., Hecher, Markus, Meel, Kuldeep S.

Volltext