ASSAT
ASSAT (Answer Sets by SAT solvers) is a system for computing answer sets of a logic program by using SAT solvers. Briefly speaking, given a ground logic program P, ASSAT(X), depending on the SAT solver X used, works as follows: Computes the completion of P and converts it into a set C of clauses. Repeats Calls X on C to get a model M (terminates with failure if no such M exists). If M is an answer set of P, then returns with it. Otherwise, finds some loops in P whose loop formulas are not satisfied by M and adds their corresponding clauses to C.
Keywords for this software
References in zbMATH (referenced in 175 articles , 1 standard article )
Showing results 1 to 20 of 175.
Sorted by year (- Hecher, Markus: Treewidth-aware reductions of normal \textscASPto \textscSAT- is normal \textscASPHarder than \textscSATafter all? (2022)
- Doherty, Patrick; Szalas, Andrzej: Rough set reasoning using answer set programs (2021)
- Luteberget, Bjørnar; Claessen, Koen; Johansen, Christian; Steffen, Martin: SAT modulo discrete event simulation applied to railway design capacity analysis (2021)
- Saribatur, Zeynep G.; Eiter, Thomas: Omission-based abstraction for answer set programs (2021)
- Saribatur, Zeynep G.; Eiter, Thomas; Schüller, Peter: Abstraction for non-ground answer set programs (2021)
- De Wulf, Wolf; Bogaerts, Bart: \textsclp2pb: translating answer set programs into pseudo-Boolean theories (2020)
- Fandinno, Jorge; Schulz, Claudia: Answering the “why” in answer set programming -- a survey of explanation approaches (2019)
- Gelfond, Michael; Zhang, Yuanlin: Vicious circle principle, aggregates, and formation of sets in ASP based languages (2019)
- Lifschitz, Vladimir: Answer set programming (2019)
- Sharma, Arpit: Using answer set programming for commonsense reasoning in the Winograd schema challenge (2019)
- Müller, Peter (ed.); Schaefer, Ina (ed.): 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 (2018)
- Alviano, Mario: Model enumeration in propositional circumscription via unsatisfiable core analysis (2017)
- Lefèvre, Claire; Béatrix, Christopher; Stéphan, Igor; Garcia, Laurent: \textscASPeRiX, a first-order forward chaining approach for answer set computing (2017)
- Lierler, Yuliya: What is answer set programming to propositional satisfiability (2017)
- Zhang, Heng; Zhang, Yan: Expressiveness of logic programs under the general stable model semantics (2017)
- Zhou, Yi; Zhang, Yan: A progression semantics for first-order logic programs (2017)
- Alliot, Jean-Marc; Demolombe, Robert; Diéguez, Martín; Fariñas del Cerro, Luis; Favre, Gilles; Faye, Jean-Charles; Obeid, Naji; Sordet, Olivier: Temporal logic modeling of biological systems (2016)
- Alliot, Jean-Marc; Diéguez, Martín; Fariñas del Cerro, Luis: Metabolic pathways as temporal logic programs (2016)
- Calimeri, Francesco; Gebser, Martin; Maratea, Marco; Ricca, Francesco: Design and results of the Fifth Answer Set Programming Competition (2016)
- Doherty, Patrick; Kvarnström, Jonas; Szałas, Andrzej: Iteratively-supported formulas and strongly supported models for Kleene answer set programs (extended abstract) (2016)
Further publications can be found at: http://assat.cs.ust.hk/#publications