The Smodels system is an Answer Set Programming (ASP) implementation based on the stable model semantics of normal logic programs. The basic idea of ASP is to encode the constraints of a problem as a logic program such that the answer sets (stable models) of the program correspond to the solutions of the problem. Then we can solve the problem by letting a logic program engine to find the answer sets of the program.

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

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

1 2 3 ... 9 10 11 next

  1. Lierler, Yuliya; Truszczynski, Miroslaw: On abstract modular inference systems and solvers (2016)
  2. Analyti, Anastasia; Viegas Damásio, Carlos; Antoniou, Grigoris: Extended RDF: computability and complexity issues (2015)
  3. Lifschitz, Vladimir: The dramatic true story of the frame default (2015)
  4. Analyti, Anastasia; Damásio, Carlos V.; Antoniou, Grigoris; Pachoulakis, Ioannis: Why-provenance information for RDF, rules, and negation (2014)
  5. Bauters, Kim; Schockaert, Steven; De Cock, Martine; Vermeir, Dirk: Semantics for possibilistic answer set programs: uncertain rules versus rules with uncertain conclusions (2014)
  6. Confalonieri, Roberto; Prade, Henri: Using possibilistic logic for modeling qualitative decision: answer set programming algorithms (2014)
  7. Göös, Mika; Lempiäinen, Tuomo; Czeizler, Eugen; Orponen, Pekka: Search methods for tile sets in patterned DNA self-assembly (2014)
  8. Lierler, Yuliya: Relating constraint answer set programming languages and algorithms (2014)
  9. Roanes-Lozano, Eugenio; Alonso, José Antonio; Hernando, Antonio: An approach from answer set programming to decision making in a railway interlocking system (2014)
  10. Analyti, Anastasia; Antoniou, Grigoris; Damásio, Carlos Viegas; Pachoulakis, Ioannis: A framework for modular ERDF ontologies (2013)
  11. Bao, Yibao; Yin, Lihua; Fang, Binxing; Guo, Li: A novel logic-based automatic approach to constructing compliant security policies (2012)
  12. Blount, Justin; Gelfond, Michael: Reasoning about the intentions of agents (2012)
  13. De Angelis, Emanuele; Pettorossi, Alberto; Proietti, Maurizio: Synthesizing concurrent programs using answer set programming (2012)
  14. Han, The Anh; Saptawijaya, Ari; Moniz Pereira, Luís: Moral reasoning under uncertainty (2012)
  15. Todorova, Yana; Gelfond, Michael: Toward question answering in travel domains (2012)
  16. Balduccini, Marcello: Learning and using domain-specific heuristics in ASP solvers (2011)
  17. Balduccini, Marcello; Girotto, Sara: ASP as a cognitive modeling tool: short-term memory and long-term memory (2011)
  18. Cakmak, Duygu; Erdem, Esra; Erdogan, Halit: Computing weighted solutions in ASP: representation-based method vs. search-based method (2011)
  19. Calimeri, Francesco; Ianni, Giovambattista; Ricca, Francesco; Alviano, Mario; Bria, Annamaria; Catalano, Gelsomina; Cozza, Susanna; Faber, Wolfgang; Febbraro, Onofrio; Leone, Nicola; Manna, Marco; Martello, Alessandra; Panetta, Claudio; Perri, Simona; Reale, Kristian; Santoro, Maria Carmela; Sirianni, Marco; Terracina, Giorgio; Veltri, Pierfrancesco: The third answer set programming competition: preliminary report of the system competition track (2011)
  20. Chen, Yin; Lin, Fangzhen; Zhang, Yan; Zhou, Yi: Loop-separable programs and their first-order definability (2011)

1 2 3 ... 9 10 11 next

Further publications can be found at: