Abstract
This paper presents a probabilistic extension of Neighbourhood Logic (NL,[14,1]). The study of such an extension is motivated by the need to supply the Probabilistic Duration Calculus (PDC, [10,4]) with a proof system. The relation between the new logic and PDC is similar to that between DC [15] and ITL [12,3]. We present a complete proof system for the new logic.
Cite
CITATION STYLE
APA
Guelev, D. P. (2000). Probabilistic neighbourhood logic. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1926, pp. 264–275). Springer Verlag. https://doi.org/10.1007/3-540-45352-0_22
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free