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

Anything in here will be replaced on browsers that support the canvas element

References in zbMATH (referenced in 168 articles , 1 standard article )

Showing results 1 to 20 of 168.
Sorted by year (citations)

1 2 3 ... 7 8 9 next

  1. Fandinno, Jorge; Schulz, Claudia: Answering the “why” in answer set programming -- a survey of explanation approaches (2019)
  2. Gelfond, Michael; Zhang, Yuanlin: Vicious circle principle, aggregates, and formation of sets in ASP based languages (2019)
  3. Lifschitz, Vladimir: Answer set programming (2019)
  4. Sharma, Arpit: Using answer set programming for commonsense reasoning in the Winograd schema challenge (2019)
  5. 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)
  6. Alviano, Mario: Model enumeration in propositional circumscription via unsatisfiable core analysis (2017)
  7. Lefèvre, Claire; Béatrix, Christopher; Stéphan, Igor; Garcia, Laurent: \textscASPeRiX, a first-order forward chaining approach for answer set computing (2017)
  8. Lierler, Yuliya: What is answer set programming to propositional satisfiability (2017)
  9. Zhang, Heng; Zhang, Yan: Expressiveness of logic programs under the general stable model semantics (2017)
  10. Zhou, Yi; Zhang, Yan: A progression semantics for first-order logic programs (2017)
  11. 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)
  12. Alliot, Jean-Marc; Diéguez, Martín; Fariñas del Cerro, Luis: Metabolic pathways as temporal logic programs (2016)
  13. Calimeri, Francesco; Gebser, Martin; Maratea, Marco; Ricca, Francesco: Design and results of the Fifth Answer Set Programming Competition (2016)
  14. Doherty, Patrick; Kvarnström, Jonas; Szałas, Andrzej: Iteratively-supported formulas and strongly supported models for Kleene answer set programs (extended abstract) (2016)
  15. Balint, Adrian; Belov, Anton; Järvisalo, Matti; Sinz, Carsten: Overview and analysis of the SAT challenge 2012 solver competition (2015) ioport
  16. Bogaerts, Bart; Van den Broeck, Guy: Knowledge compilation of logic programs using approximation fixpoint theory (2015)
  17. Fichte, Johannes Klaus; Szeider, Stefan: Backdoors to tractable answer set programming (2015)
  18. Fichte, Johannes K.; Szeider, Stefan: Backdoors to normality for disjunctive logic programs (2015)
  19. Fierens, Daan; Van den Broeck, Guy; Renkens, Joris; Shterionov, Dimitar; Gutmann, Bernd; Thon, Ingo; Janssens, Gerda; De Raedt, Luc: Inference and learning in probabilistic logic programs using weighted Boolean formulas (2015)
  20. Gebser, Martin; Janhunen, Tomi; Jost, Holger; Kaminski, Roland; Schaub, Torsten: ASP solving for expanding universes (2015)

1 2 3 ... 7 8 9 next


Further publications can be found at: http://assat.cs.ust.hk/#publications