Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
The fourth answer set programming competition: Preliminary report
Dipartimento di Matematica e Informatica, Università Della Calabria, Italy.
Dipartimento di Matematica e Informatica, Università Della Calabria, Italy.
Institute of Information Systems, Vienna University of Technology, Austria.
Institute of Information Systems, Vienna University of Technology, Austria.
Show others and affiliations
2013 (English)In: Logic Programming and Nonmonotonic Reasoning: 12th International Conference, LPNMR 2013, Corunna, Spain, September 15-19, 2013, Proceedings, Springer, 2013, p. 42-53Conference paper, Published paper (Refereed)
Abstract [en]

Answer Set Programming is a well-established paradigm of declarative programming in close relationship with other declarative formalisms such as SAT Modulo Theories, Constraint Handling Rules, PDDL and many others. Since its first informal editions, ASP systems are compared in the nowadays customary ASP Competition. The fourth ASP Competition, held in 2012/2013, is the sequel to previous editions and it was jointly organized by University of Calabria (Italy) and the Vienna University of Technology (Austria). Participants competed on a selected collection of benchmark problems, taken from a variety of research areas and real world applications. The Competition featured two tracks: the Model& Solve Track, held on an open problem encoding, on an open language basis, and open to any kind of system based on a declarative specification paradigm; and the System Track, held on the basis of fixed, public problem encodings, written in a standard ASP language.

Place, publisher, year, edition, pages
Springer, 2013. p. 42-53
Series
Lecture Notes in Computer Science, ISSN 0302-9743, E-ISSN 1611-3349 ; 8148
Keywords [en]
Answer set programming, Bench-mark problems, Constraint Handling Rules, Declarative Programming, Encodings, Open languages, Sat modulo theories, System tracks, Encoding (symbols), Logic programming
National Category
Computer Sciences
Identifiers
URN: urn:nbn:se:hj:diva-63566DOI: 10.1007/978-3-642-40564-8_5Scopus ID: 2-s2.0-84885770282ISBN: 9783642405631 (print)OAI: oai:DiVA.org:hj-63566DiVA, id: diva2:1838424
Conference
12th International Conference, LPNMR 2013, Corunna, Spain, September 15-19, 2013
Available from: 2024-02-16 Created: 2024-02-16 Last updated: 2024-02-16Bibliographically approved

Open Access in DiVA

No full text in DiVA

Other links

Publisher's full textScopus

Authority records

Oetsch, Johannes

Search in DiVA

By author/editor
Oetsch, Johannes
Computer Sciences

Search outside of DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetric score

doi
isbn
urn-nbn
Total: 48 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf