Projects funded by the NCN
Finding Applications for Logic with Partial Functions
2015/17/B/ST6/01898
Keywords:
verification theorem proving type systems mechanics
Descriptors:
- ST6_4: Formal methods, foundations of computer science, including theoretical computer science, quantum algorithms
Panel:
ST6 - Computer science and informatics: informatics and information systems, computer science, scientific computing, intelligent systems
Host institution :
Uniwersytet Wrocławski, Wydział Matematyki i Informatyki
woj. dolnośląskie
Principal investigator (from the host institution):
Number of co-investigators in the project: 3
Call: OPUS 9 - announced on 2015-03-16
Amount awarded: 235 200 PLN
Project start date (Y-m-d): 2016-02-18
Project end date (Y-m-d): 2019-07-17
Project duration:: 41 months (the same as in the proposal)
Project status: Project settled
Project description
Download the project description in a pdf file
Note - project descriptions were prepared by the authors of the applications themselves and placed in the system in an unchanged form.
Equipment purchased [PL]
- Komputer Ultrabook Acer S5-371.
Information in the final report
- Publication in academic press/journals (1)
- Subsumption Algorithms for Three-Valued Geometric ResolutionAuthors:Hans de NivelleAcademic press:Logical Methods in Computer Science (rok: 2018, tom: Special Issue, strony: b.d.), Wydawca: Logical Methods in Computer Science e.V.Status:PublishedDOI:10.23638/LMCS-14(4:24)2018 - link to the publication