Asparagus Web-based Benchmarking Environment: Answer Set Programming (ASP) emerged in the late 1990s as a new declarative programming paradigm, having its roots in Nonmonotonic Reasoning, Deductive Databases and Logic Programming with negation as failure. Since its inception, ASP has been regarded as the computational embodiment of Nonmonotonic Reasoning and a primary candidate for an effective knowledge representation tool. This view has been boosted by the emergence of highly efficient solvers for ASP.
References in zbMATH (referenced in 5 articles )
Showing results 1 to 5 of 5.
- Charwat, Günther; Ianni, Giovambattista; Krennwallner, Thomas; Kronegger, Martin; Pfandler, Andreas; Redl, Christoph; Schwengerer, Martin; Spendier, Lara Katharina; Wallner, Johannes Peter; Xiao, Guohui: VCWC: a versioning competition workflow compiler (2013) ioport
- Marple, Kyle; Gupta, Gopal: Galliwasp: a goal-directed answer set solver (2013) ioport
- Andres, Benjamin; Kaufmann, Benjamin; Matheis, Oliver; Schaub, Torsten: Unsatisfiability-based optimization in clasp (2012)
- Brain, Martin; Crick, Tom; De Vos, Marina; Fitch, John: TOAST: Applying answer set programming to superoptimisation (2006)
- Anger, Christian; Gebser, Martin; Linke, Thomas; Neumann, André; Schaub, Torsten: The nomore++ approach to answer set solving (2005)