Cited in
(only showing first 100 items - show all)- A characterization of answer sets for logic programs
- Monotonic Answer Set Programming
- Logic programming with infinite sets
- Graphs and colorings for answer set programming
- Temporal phylogenetic networks and logic programming
- Guarded resolution for answer set programming
- Logic Programming
- Semantics and complexity of recursive aggregates in answer set programming
- Look-back techniques for ASP programs with aggregates
- Outlier detection using default reasoning
- Model enumeration in propositional circumscription via unsatisfiable core analysis
- Automata and Answer Set Programming
- My work with Victor Marek: a mathematician looks at answer set programming
- Answer Set Programming: A Declarative Approach to Solving Search Problems
- Twelve Definitions of a Stable Model
- Equilibrium logic
- A general first-order solution to the ramification problem with cycles
- Answer Set Programming: A Primer
- Effectively reasoning about infinite sets in answer set programming
- Level Mapping Induced Loop Formulas for Weight Constraint and Aggregate Programs
- Ordered completion for first-order logic programs on finite structures
- Logic Programming
- On elementary loops of logic programs
- Characterising equilibrium logic and nested logic programs: Reductions and complexity,
- scientific article; zbMATH DE number 5079838 (Why is no real title available?)
- Unfolding partiality and disjunctions in stable model semantics
- Improving the normalization of weight rules in answer set programs
- Towards Overcoming the Knowledge Acquisition Bottleneck in Answer Set Prolog Applications: Embracing Natural Language Inputs
- Loop-separable programs and their first-order definability
- Experimenting with recursive queries in database and logic programming systems
- scientific article; zbMATH DE number 5043340 (Why is no real title available?)
- Loop formulas for description logic programs
- Abstraction for non-ground answer set programs
- Rough set reasoning using answer set programs
- Merging Belief Bases Represented by Logic Programs
- A generalization of the Lin-Zhao theorem
- 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
- Towards automated integration of guess and check programs in answer set programming: a meta-interpreter and applications
- SAT modulo graphs: acyclicity
- Experimenting with parallelism for the instantiation of ASP programs
- Stable models and circumscription
- Tableau Calculi for Answer Set Programming
- Reducts of propositional theories, satisfiability relations, and generalizations of semantics of logic programs
- Engineering an Incremental ASP Solver
- Theory and Applications of Satisfiability Testing
- Stable models and difference logic
- Implementing prioritized merging with ASP
- Answer set programming based on propositional satisfiability
- Modularity aspects of disjunctive stable models
- Evaluating ASP and commercial solvers on the CSPLib
- Integrating answer set programming and constraint logic programming
- On the relation among answer set solvers
- Logic Programming and Nonmonotonic Reasoning
- Computing loops with at most one external support rule for disjunctive logic programs
- Satisfiability checking in Łukasiewicz logic as finite constraint satisfaction
- Integrating Inductive Definitions in SAT
- Automatic network reconstruction using ASP
- Inference and learning in probabilistic logic programs using weighted Boolean formulas
- Knowledge compilation of logic programs using approximation fixpoint theory
- An empirical study of constraint logic programming and answer set programming solutions of combinatorial problems
- Weight Constraint Programs with Functions
- Optimization of bound disjunctive queries with constraints
- Bridging the gap between reinforcement learning and knowledge representation: a logical off- and on-policy framework
- Using Answer Set Programming for Commonsense Reasoning in the Winograd Schema Challenge
- Disjunctive logic programs, answer sets, and the cut rule
- Loop formulas for splitable temporal logic programs
- Logic Programming and Nonmonotonic Reasoning
- Iteratively-supported formulas and strongly supported models for Kleene answer set programs (extended abstract)
- Achieving compositionality of the stable model semantics for <scp>smodels</scp> programs
- Alternative Characterizations for Program Equivalence under Answer-Set Semantics Based on Unfounded Sets
- {\textsc{ASPeRiX}}, a first-order forward chaining approach for answer set computing
- On the Continuity of Gelfond-Lifschitz Operator and Other Applications of Proof-Theory in ASP
- Quo Vadis Answer Set Programming?
- Discovering classes of strongly equivalent logic programs
- On the Complexity of Answer Set Programming with Aggregates
- Explanatory Nonmonotonic Reasoning
- Logic Programming
- Heuristics for planning with penalties and rewards formulated in logic and computed through circuits
- ASPeRiX
- GNT
- PLATYPUS
- Cmodels
- Siege
- DLV
- DLV-EX
- Gringo
- Lparse
- PBS
- Smodels
- ASPIDE
- Prolog
- BerkMin
- CP-logic
- SCR
- Potassco
- clasp
- GASP
- NoMoRe
- Asparagus
- SATMC
This page was built for software: ASSAT
