ASSAT

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)

• Logic programming with infinite sets
• Semantics and complexity of recursive aggregates in answer set programming
• Outlier detection using default reasoning
• 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
• Effectively reasoning about infinite sets in answer set programming
• Equilibrium logic
• Ordered completion for first-order logic programs on finite structures
• Title not available (Why is that?)
• Loop-separable programs and their first-order definability
• Loop formulas for description logic programs
• Merging Belief Bases Represented by Logic Programs
• 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
• Modularity aspects of disjunctive stable models
• 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
• Achieving compositionality of the stable model semantics for <scp>smodels</scp> programs
• On the Complexity of Answer Set Programming with Aggregates
• Discovering classes of strongly equivalent 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
• 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
• Compact translations of non-disjunctive answer set programs to propositional clauses
• The intelligent grounder of DLV
• Normalizing cardinality rules using merging and sorting constructions
• Catching the Ouroboros: on debugging non-ground answer-set programs
• Logic Programming and Nonmonotonic Reasoning
• Logic Programming and Nonmonotonic Reasoning
• A logic of fixpoint definitions
• Conflict-Driven Answer Set Enumeration
• Backdoors to normality for disjunctive logic programs
• Logic Programming
• Logic Programming for Knowledge Representation
• Actions over a constructive semantics for description logics
• Semantic forgetting in answer set programming
• Title not available (Why is that?)
• Max-ASP: Maximum Satisfiability of Answer Set Programs
• GASP: Answer set programming with lazy grounding
• 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
• Properties and applications of programs with monotone and convex constraints
• Level Mapping Induced Loop Formulas for Weight Constraint and Aggregate Programs
• Title not available (Why is that?)
• Abstraction for non-ground answer set programs
• Principled software development. Essays dedicated to Arnd Poetzsch-Heffter on the occasion of his 60th birthday. Selected papers based on the presentations at the symposium, Kaiserslautern, Germany, November 2018
• Implementing prioritized merging with ASP
• Integrating Inductive Definitions in SAT
• Using Answer Set Programming for Commonsense Reasoning in the Winograd Schema Challenge
• {\textsc{ASPeRiX}}, a first-order forward chaining approach for answer set computing
• Omission-based abstraction for answer set programs
• Answer set programming
• Title not available (Why is that?)
• Level mapping induced loop formulas for weight constraint and aggregate logic programs
• A normal form for linear temporal equilibrium logic
• ASP solving for expanding universes
• From (Quantified) Boolean Formulae to Answer Set Programming

This page was built for software: ASSAT