Logic programming: Laxness and Saturation
- Submitting institution
-
Heriot-Watt University
- Unit of assessment
- 11 - Computer Science and Informatics
- Output identifier
- 23056404
- 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 paper, arising from grants EP/K031864/1-2, EP/K028243/1 and the Royal Society grant IE151369, gives a definitive formulation of coalgebraic semantics of logic programming, unifying the two previously existing approaches (one by the same authors, and another -- by authors in U. of Bologna). The paper is an invited journal version of a previous conference paper presented at Coalgebraic Methods in Computer Science 2016. The work was well-received by the community, and was the subject of several invited talks, e.g. at ALCOOP'17, Shonan'17, and Coalgebra, Now! workshop at FLOC'18 given by Komendantskaya as well as several other invited talks by Power.
- Author contribution statement
- -
- Non-English
- No
- English abstract
- -
