Baral, C. and Provetti, Alessandro and Son, T.C. (2003) Introduction to the special issue on programming with answer sets. [Editorial/Introduction]
Abstract
The search for an appropriate characterization of negation as failure in logic programs in the mid 1980s led to several proposals. Amongst them the stable model semantics – later referred to as answer set semantics, and the well-founded semantics are the most popular and widely referred ones. According to the latest (September 2002) list of most cited source documents in the CiteSeer database (http://citeseer.nj.nec.com) the original stable model semantics paper (Gelfond and Lifschitz, 1988) is ranked 10th with 649 citations and the well-founded semantics paper (Van Gelder et al., 1991) is ranked 70th with 306 citations. Since 1988 – when stable models semantics was proposed – there has been a large body of work centered around logic programs with answer set semantics covering topics such as: systematic program development, systematic program analysis, knowledge representation, declarative problem solving, answer set computing algorithms, complexity and expressiveness, answer set computing systems, relation with other non-monotonic and knowledge representation formalisms, and applications to various tasks.
Metadata
| Item Type: | Editorial/Introduction |
|---|---|
| School: | Birkbeck Faculties and Schools > Faculty of Science > School of Computing and Mathematical Sciences |
| Depositing User: | Sarah Hall |
| Date Deposited: | 27 Jul 2021 16:17 |
| Last Modified: | 09 Aug 2023 12:51 |
| URI: | https://eprints.bbk.ac.uk/id/eprint/45301 |
Statistics
Additional statistics are available via IRStats2.
Archive Staff Only (login required)
