ASSAT - MaRDI portal

Cited in

(only showing first 100 items - show all)

Evaluating ASP and commercial solvers on the CSPLib
My work with Victor Marek: a mathematician looks at answer set programming
On the relation among answer set solvers
Integrating answer set programming and constraint logic programming
Stable models and difference logic
Hyperequivalence of logic programs with respect to supported models
ASPeRiX
GNT
PASTA
Dsharp
PLATYPUS
Cmodels
Siege
PBS
Gringo
Smodels
Lparse
A progression semantics for first-order logic programs
DLV
DLV-EX
What is answer set programming to propositional satisfiability
Conflict-driven answer set solving: from theory to practice
Magic sets for disjunctive Datalog programs
ASPIDE
Prolog
BerkMin
SCR
CP-logic
Potassco
NoMoRe
clasp
GASP
SAT modulo discrete event simulation applied to railway design capacity analysis
Asparagus
Disjunctive logic programs, answer sets, and the cut rule
Graph-based construction of minimal models
SATMC
Recursive rules with aggregation: a simple unified semantics
WASP
QUBOS
VIDEAS
STeLP
Clingcon
Clingo
f2lp
CCalc
Rough set reasoning using answer set programs
NMRDPP
Vicious circle principle, aggregates, and formation of sets in ASP based languages
iClingo
Backdoors to tractable answer set programming
Heuristics for planning with penalties and rewards formulated in logic and computed through circuits
Semantic forgetting in answer set programming
Outlier detection using default reasoning
On look-ahead heuristics in disjunctive logic programming
Enhancing DLV instantiator by backjumping techniques
A general first-order solution to the ramification problem with cycles
Loop formulas for circumscription
ROSoClingo
A characterization of answer sets for logic programs
Treewidth-aware reductions of normal \textsc{ASP} to \textsc{SAT} - is normal \textsc{ASP} Harder than \textsc{SAT} after all?
Efficient computation of answer sets via SAT modulo acyclicity and vertex elimination
Metabolic pathways as temporal logic programs
Iteratively-supported formulas and strongly supported models for Kleene answer set programs (extended abstract)
Normalizing cardinality rules using merging and sorting constructions
Dynamic and static symmetry breaking in answer set programming
On elementary loops of logic programs
BEE
Look-back techniques for ASP programs with aggregates
The intelligent grounder of DLV
SAT modulo graphs: acyclicity
Improving the normalization of weight rules in answer set programs
Tableau calculi for logic programs under answer set semantics
On testing answer-set programs
Compact translations of non-disjunctive answer set programs to propositional clauses
Effectively reasoning about infinite sets in answer set programming
Loop formulas for splitable temporal logic programs
A general framework for equivalences in answer-set programming by countermodels in the logic of here-and-there
scientific article; zbMATH DE number 5914356 (Why is no real title available?)
Bridging the gap between reinforcement learning and knowledge representation: a logical off- and on-policy framework
Automatic network reconstruction using ASP
Guarded resolution for answer set programming
A logic of fixpoint definitions
Embedding functions into disjunctive logic programs
Efficient parallel ASP instantiation via dynamic rewriting
On demand indexing for the DLV instantiator
Integrating grounding in the search process for answer set computing
Implementing prioritized merging with ASP
PySMT
Characterising equilibrium logic and nested logic programs: Reductions and complexity,
Datalog
GraphLog
htd
nomore++
RailCNL
Monotonic Answer Set Programming
From (Quantified) Boolean Formulae to Answer Set Programming
The Significance of Memory Costs in Answer Set Solver Implementation
Actions over a constructive semantics for description logics
GASP: Answer set programming with lazy grounding

This page was built for software: ASSAT