Logic in Computer Science: Modelling and Reasoning about Systems

By D. Bridges, Cristian S. Calude, Michael J. Dinneen, B. Khoussainov. 2000

623 citations recorded by the source corpus.

Subfields: Computational Theory and Mathematics

View Paper: https://www.semanticscholar.org/paper/030ccc44a58c1490984e1650d461491f80486bbc

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computational Theory and Mathematics

Citations in the corpus

Towards Reasoning in Large Language Models: A Survey (2022, background): “The study of reasoning is important in fields like psychology (Wason and Johnson-Laird, 1972), philosophy (Passmore, 1961), and computer science (Huth and Ryan, 2004), as it helps individuals make decisions, solve problems, and think critically.”
Tensor Networks : Deep Learning and Logical Reasoning from Data and Knowledge ⋆ (2016, background): “For simplicity, we assume that all sentences of L are in prenex conjunctive, skolemised normal form [16], e.”
A Proof Assistant for Higher-Order Logic (2002, background): “For more CTL exercises see, for example, Huth and Ryan [17].”
The SPIN Model Checker - primer and reference manual (2003, background): “Bibliographic Notes A formal treatments of the notions of dependence of actions (transitions) and the equivalence of -runs can be found in, for instance, Mazurkiewicz [1986], and Kwiatkowska [1989].”
Application of formal methods to biological regulatory networks: extending Thomas' asynchronous logical approach with temporal logic. (2004, methodology): “On the other hand, the CTL formulae being given, one can automatically extract the compatible models, i.e. the compatible families of parameters K: For each state graph, model checking very efficiently computes all the states which satisfy a set of formulae (Huth and Ryan, 2000).”
Isabelle/HOL (2002, background): “Model checking is a popular technique for the verification of finite state systems (implementations) with respect to temporal logic formulae (specifications) [7, 14].”
Enabling Flexibility in Process-Aware Information Systems (2012, methodology): “One common way to perform a priori compliance checking is to use model checking techniques [136].”
Receding Horizon Temporal Logic Planning (2012, background): “In fact, a design bug in Alice related to a mismatch in the abstraction of the physical system used at different levels of the hierarchy had never been discovered in thousands of hours of our extensive simulations and over three hundred miles of ﬁeld testing [5].”
Principles of model checking (2008, methodology): “More information on model checking is available in the earlier books by Holzmann [205], McMillan [288], and Kurshan [250] and the more recent works by Clarke, Grumberg, and Peled [92], Huth and Ryan [219], Schneider [365], and Bérard et al.”
Probabilistic (logic) programming concepts (2015, neutral): “It is well known that the transitive closure of a binary relation cannot be represented in ﬁrst order logic, but requires second order constructs; see Huth and Ryan (2004) for a detailed formal discussion.”