Paracomplete logic Kl: natural deduction, its automation, complexity and applications
- Submitting institution
-
The University of Westminster
- Unit of assessment
- 11 - Computer Science and Informatics
- Output identifier
- q16q6
- Type
- D - Journal article
- DOI
-
-
- Title of journal
- Journal of Applied Logics - IfCoLog Journal of Logics and their Applications
- Article number
- -
- First page
- 221
- Volume
- 5
- Issue
- 1
- ISSN
- 2055-3706
- Open access status
- Compliant
- Month of publication
- February
- Year of publication
- 2018
- URL
-
http://collegepublications.co.uk/ifcolog/?00021
- 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
- 0
- Proposed double-weighted
- No
- Reserve for an output with double weighting
- No
- Additional information
- Paracomplete logics, where a statement and its negation may be both untrue, provide reasoning framework for complex heterogeneous systems where parts of specification are unknown. This paper is significant because it defines efficient automated proof search for paracomplete logic and the first account of its complexity. The paper culminates long term collaboration with Lomonosov Moscow University and University of Poznan, which brought over 50 publications and has significantly influenced research in these institutions. These statements can be evidenced by Prof Vladimir Markin, Chair, Dept of Logic, Moscow University (vladimirmarkin@mail.ru); and Prof Mariusz Urbanski, Chair of Logic, University of Poznan (murbansk@gmail.com).
- Author contribution statement
- -
- Non-English
- No
- English abstract
- -
