The phrase 'computational logic' is correct and can be used in written English.
It is typically used to refer to the process of programming computer systems, or the syntax and semantics of programming languages. For example, "The professor is teaching a course on computational logic, focusing on the algorithms and data structures necessary for designing a computer program."
Intuitions seem to conflict, and it is difficult to find ways to model the important phenomena using logical techniques.[35] Fagin et al. 1984 begins a tradition in computational logic that revives the modal approach to epistemic logic, developing generalized logical foundations and applications that had not occurred to the philosophers.
Powerdomains were introduced to describe non-deterministic behaviour of computational logic.
Building on common and widely used concepts from discrete mathematics and computational logic, it combines abstract states with transition systems.
Model checking is a fruitful application of computational logic with high relevance to the verification of concurrent systems.
They are hierarchically organised and backed by computational logic which allows automated inferences of the implicit consequences of explicitly stated knowledge.
Based on common concepts of computational logic and discrete mathematics, we formalize vignette specifications as abstract state machine (ASM) models [7, 14].
BWAGIR achieves a significant performance by pipelining computational logics, parallelizing the resampling process and the calculation of correlation coefficient and parallel memory access.
It should be cautioned however that computational logics identifying putatively 'neutral' markers do not guarantee true neutrality: it remains as a prime challenge in modern genomics to experimentally establish neutrality or functionality of non-coding regions.
Computational tree logic (CTL) is a form of temporal logic to express temporal logic formulae which can be checked by model checking software.
The absence of errors is checked via computational tree logic (CTL) (Clarke and Emerson 1982) or linear temporal logic (LTL) (Pnueli 1977) statements.
An interesting feature of Coq is the possibility of defining inductive types that mix computational and logic parts.
