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.

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

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

1 2 3 ... 6 7 8 next

  1. Alviano, Mario: Model enumeration in propositional circumscription via unsatisfiable core analysis (2017)
  2. Gavanelli, Marco; Nonato, Maddalena; Peano, Andrea; Bertozzi, Davide: Logic programming approaches for routing fault-free and maximally parallel wavelength-routed optical networks-on-chip (application paper) (2017)
  3. Lefèvre, Claire; Béatrix, Christopher; Stéphan, Igor; Garcia, Laurent: ASPeRiX, a first-order forward chaining approach for answer set computing (2017)
  4. Lierler, Yuliya: What is answer set programming to propositional satisfiability (2017)
  5. Zhang, Heng; Zhang, Yan: Expressiveness of logic programs under the general stable model semantics (2017)
  6. Zhou, Yi; Zhang, Yan: A progression semantics for first-order logic programs (2017)
  7. Alliot, Jean-Marc; Diéguez, Martín; Fariñas del Cerro, Luis: Metabolic pathways as temporal logic programs (2016)
  8. Calimeri, Francesco; Gebser, Martin; Maratea, Marco; Ricca, Francesco: Design and results of the Fifth Answer Set Programming Competition (2016)
  9. Doherty, Patrick; Kvarnström, Jonas; Szałas, Andrzej: Iteratively-supported formulas and strongly supported models for Kleene answer set programs (extended abstract) (2016)
  10. Balint, Adrian; Belov, Anton; Järvisalo, Matti; Sinz, Carsten: Overview and analysis of the SAT challenge 2012 solver competition (2015) ioport
  11. Bogaerts, Bart; Van den Broeck, Guy: Knowledge compilation of logic programs using approximation fixpoint theory (2015)
  12. Fichte, Johannes Klaus; Szeider, Stefan: Backdoors to tractable answer set programming (2015)
  13. Fichte, Johannes K.; Szeider, Stefan: Backdoors to normality for disjunctive logic programs (2015)
  14. 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)
  15. Benhamou, Belaïd: Dynamic and static symmetry breaking in answer set programming (2013)
  16. Strass, Hannes; Thielscher, Michael: A general first-order solution to the ramification problem with cycles (2013)
  17. Alviano, Mario; Faber, Wolfgang; Greco, Gianluigi; Leone, Nicola: Magic sets for disjunctive Datalog programs (2012)
  18. Asuncion, Vernon; Lin, Fangzhen; Zhang, Yan; Zhou, Yi: Ordered completion for first-order logic programs on finite structures (2012)
  19. Faber, Wolfgang; Leone, Nicola; Perri, Simona: The intelligent grounder of DLV (2012)
  20. Gebser, Martin; Kaufmann, Benjamin; Schaub, Torsten: Conflict-driven answer set solving: from theory to practice (2012)

1 2 3 ... 6 7 8 next

Further publications can be found at: