Logic programming : Laxness and saturation
- Submitting institution
-
The University of Bath
- Unit of assessment
- 11 - Computer Science and Informatics
- Output identifier
- 158151496
- Type
- D - Journal article
- DOI
-
10.1016/j.jlamp.2018.07.004
- Title of journal
- Journal of Logical and Algebraic Methods in Programming
- Article number
- -
- First page
- 1
- Volume
- 101
- Issue
- -
- ISSN
- 2352-2208
- Open access status
- Compliant
- Month of publication
- July
- Year of publication
- 2018
- URL
-
-
- Supplementary information
-
-
- Request cross-referral to
- -
- Output has been delayed by COVID-19
- No
- COVID-19 affected output statement
- -
- Forensic science
- No
- Criminology
- No
- Interdisciplinary
- No
- Number of additional authors
-
1
- Research group(s)
-
-
- Citation count
- 1
- Proposed double-weighted
- No
- Reserve for an output with double weighting
- No
- Additional information
- The authors of this paper introduced a category-theoretic conceptual investigation of logic programs in 2011, using lax coalgebras. Bonchi and Zanasi later proposed an apparently competing approach. These coalgebraic semantics have generated interest and further work e.g. by Bruni et al as well as by the authors. This paper unifies the approaches and explains the two semantics as distinct viewpoints on logic programming: thus this is not only a mathematical rapprochement but also provides new semantic insight. This elegant approach also permits the development of a mathematical correspondence between logic programming and the computational phenomenon of local state.
- Author contribution statement
- -
- Non-English
- No
- English abstract
- -