Software:15063

swMATH2524MaRDI QIDQ15063FDOQ15063

Author name not available (Why is that?)

Described by source

• ASSAT: computing answer sets of a logic program by SAT solvers

Cited In (only showing first 100 items - show all)

• Normalizing Cardinality Rules Using Merging and Sorting Constructions
• Logic programming with infinite sets
• The Intelligent Grounder of DLV
• Compact Translations of Non-disjunctive Answer Set Programs to Propositional Clauses
• Semantics and complexity of recursive aggregates in answer set programming
• Outlier detection using default reasoning
• Title not available (Why is that?)
• My work with Victor Marek: a mathematician looks at answer set programming
• Twelve Definitions of a Stable Model
• Unfolding partiality and disjunctions in stable model semantics
• Catching the Ouroboros: On debugging non-ground answer-set programs
• Equilibrium logic
• Ordered completion for first-order logic programs on finite structures
• Title not available (Why is that?)
• Actions Over a Constructive Semantics for Description Logics
• Loop-separable programs and their first-order definability
• Loop formulas for description logic programs
• Merging Belief Bases Represented by Logic Programs
• GASP: Answer Set Programming with Lazy Grounding
• A generalization of the Lin-Zhao theorem
• Tableau Calculi for Answer Set Programming
• Engineering an Incremental ASP Solver
• Stable models and circumscription
• Reducts of propositional theories, satisfiability relations, and generalizations of semantics of logic programs
• Stable models and difference logic
• Answer set programming based on propositional satisfiability
• Evaluating ASP and commercial solvers on the CSPLib
• Integrating answer set programming and constraint logic programming
• On the relation among answer set solvers
• Inference and learning in probabilistic logic programs using weighted Boolean formulas
• Knowledge compilation of logic programs using approximation fixpoint theory
• Optimization of bound disjunctive queries with constraints
• Automatic network reconstruction using ASP
• An empirical study of constraint logic programming and answer set programming solutions of combinatorial problems
• Weight Constraint Programs with Functions
• Satisfiability checking in Łukasiewicz logic as finite constraint satisfaction
• Logic Programming and Nonmonotonic Reasoning
• Title not available (Why is that?)
• Achieving compositionality of the stable model semantics for <scp>smodels</scp> programs
• Effectively Reasoning about Infinite Sets in Answer Set Programming
• On the Complexity of Answer Set Programming with Aggregates
• Backdoors to Normality for Disjunctive Logic Programs
• Explanatory Nonmonotonic Reasoning
• Logic Programming
• Debugging ASP Programs by Means of ASP
• Heuristics for planning with penalties and rewards formulated in logic and computed through circuits
• Probabilistic Reasoning by SAT Solvers
• Reasoning and planning with sensing actions, incomplete information, and static causal laws using answer set programming
• Conflict-driven answer set solving: from theory to practice
• Magic sets for disjunctive Datalog programs
• Equivalences in Answer-Set Programming by Countermodels in the Logic of Here-and-There
• Title not available (Why is that?)
• Loop formulas for circumscription
• The loop formula based semantics of description logic programs
• Title not available (Why is that?)
• The nomore + + Approach to Answer Set Solving
• Hyperequivalence of logic programs with respect to supported models
• TOAST: Applying Answer Set Programming to Superoptimisation
• Logic Programming and Nonmonotonic Reasoning
• Logic Programming and Nonmonotonic Reasoning
• Logic programs with monotone abstract constraint atoms
• Planning with preferences using logic programming
• Head-Elementary-Set-Free Logic Programs
• Logic Programming and Nonmonotonic Reasoning
• Logic Programming and Nonmonotonic Reasoning
• Compiling Fuzzy Answer Set Programs to Fuzzy Propositional Theories
• Abstract Answer Set Solvers
• Backdoors to tractable answer set programming
• Weight constraint programs with evaluable functions
• Modularity Aspects of Disjunctive Stable Models
• Logic Programming and Nonmonotonic Reasoning
• Logic Programming and Nonmonotonic Reasoning
• Conflict-Driven Answer Set Enumeration
• Logic Programming
• Logic Programming for Knowledge Representation
• Semantic forgetting in answer set programming
• Title not available (Why is that?)
• Max-ASP: Maximum Satisfiability of Answer Set Programs
• Logic Programming and Nonmonotonic Reasoning
• Logic Programming
• Logic Programming
• Thirteen Definitions of a Stable Model
• Modularity Aspects of Disjunctive Stable Models
• Enhancing disjunctive logic programming systems by SAT checkers
• Logic Programming and Nonmonotonic Reasoning
• Omission-Based Abstraction for Answer Set Programs
• ASP Solving for Expanding Universes
• Level Mapping Induced Loop Formulas for Weight Constraint and Aggregate Programs
• Title not available (Why is that?)
• Abstraction for non-ground answer set programs
• A Normal Form for Linear Temporal Equilibrium Logic
• Integrating Inductive Definitions in SAT
• Using Answer Set Programming for Commonsense Reasoning in the Winograd Schema Challenge
• Level Mapping Induced Loop Formulas for Weight Constraint and Aggregate Logic Programs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Implementing Prioritized Merging with ASP
• Title not available (Why is that?)
• Title not available (Why is that?)
• Principled Software Development

This page was built for software: ASSAT