|Affiliations:||Mathematical Institute of the Serbian Academy of Sciences and Arts||Title:||Measure logic||Journal:||Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)||Volume:||4724||First page:||128||Last page:||138||Conference:||European Conference on Symbolic and Quantitative Approaches to Reasoning and Uncertainty, ECSQARU 2007||Issue Date:||1-Jan-2007||Rank:||M23||ISBN:||978-354075255-4||ISSN:||0302-9743||DOI:||10.1007/978-3-540-75256-1_14||Abstract:||
In this paper we investigate logic which is suitable for reasoning about uncertainty in different situations. A possible-world approach is used to provide semantics to formulas. Axiomatic system for our logic is given and the corresponding strong completeness theorem is proved. Relationships to other systems are discussed.
|Keywords:||Axiomatic system | Logic programming | Theorem proving||Publisher:||Springer Link|
Show full item record
checked on Sep 17, 2022
checked on Sep 15, 2022
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.