Switch to: References

Add citations

You must login to add citations.
  1. Speed Up the Conception of Logical Systems with Test-Driven Development.Mathieu Vidal - 2014 - Journal of Logic, Language and Information 23 (1):83-103.
    In this paper, I stress the utility of employing test-driven development (TDD) for conceiving logical systems. TDD, originally invented in the context of Extreme Programming, is a methodology widely used by software engineers to conceive and develop programs. Its main principle is to design the tests of the expected properties of the system before the development phase. I argue that this methodology is especially convenient in conceiving applied logics. Indeed, this technique is efficient with most decidable logics having a software (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • Why There is no General Solution to the Problem of Software Verification.John Symons & Jack K. Horner - 2020 - Foundations of Science 25 (3):541-557.
    How can we be certain that software is reliable? Is there any method that can verify the correctness of software for all cases of interest? Computer scientists and software engineers have informally assumed that there is no fully general solution to the verification problem. In this paper, we survey approaches to the problem of software verification and offer a new proof for why there can be no general solution.
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • Reasoning About Truth in First-Order Logic.Claes Strannegård, Fredrik Engström, Abdul Rahim Nizamani & Lance Rips - 2013 - Journal of Logic, Language and Information 22 (1):115-137.
    First, we describe a psychological experiment in which the participants were asked to determine whether sentences of first-order logic were true or false in finite graphs. Second, we define two proof systems for reasoning about truth and falsity in first-order logic. These proof systems feature explicit models of cognitive resources such as declarative memory, procedural memory, working memory, and sensory memory. Third, we describe a computer program that is used to find the smallest proofs in the aforementioned proof systems when (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • Implementation of Belief Change Operators Using BDDs.Nikos Gorogiannis & Mark D. Ryan - 2002 - Studia Logica 70 (1):131-156.
    While the theory of belief change has attracted a lot of interest from researchers, work on implementing belief change and actually putting it to use in real-world problems is still scarce. In this paper, we present an implementation of propositional belief change using Binary Decision Diagrams. Upper complexity bounds for the algorithm are presented and discussed. The approach is presented both in the general case, as well as on specific belief change operators from the literature. In an effort to gain (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • Axiomatic and dual systems for constructive necessity, a formally verified equivalence.Lourdes del Carmen González-Huesca, Favio E. Miranda-Perea & P. Selene Linares-Arévalo - 2019 - Journal of Applied Non-Classical Logics 29 (3):255-287.
    We present a proof of the equivalence between two deductive systems for constructive necessity, namely an axiomatic characterisation inspired by Hakli and Negri's system of derivations from assumptions for modal logic , a Hilbert-style formalism designed to ensure the validity of the deduction theorem, and the judgmental reconstruction given by Pfenning and Davies by means of a natural deduction approach that makes a distinction between valid and true formulae, constructively. Both systems and the proof of their equivalence are formally verified (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Contract as automaton: representing a simple financial agreement in computational form.Mark D. Flood & Oliver R. Goodenough - 2022 - Artificial Intelligence and Law 30 (3):391-416.
    We show that the fundamental legal structure of a well-written financial contract follows a state-transition logic that can be formalized mathematically as a finite-state machine (specifically, a deterministic finite automaton or DFA). The automaton defines the states that a financial relationship can be in, such as “default,” “delinquency,” “performing,” etc., and it defines an “alphabet” of events that can trigger state transitions, such as “payment arrives,” “due date passes,” etc. The core of a contract describes the rules by which different (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Kees van Deemter: Not Exactly: In Praise of Vagueness: Oxford University Press, Oxford, 2010, xvi+341, $29.95, ISBN: 0-199-5459-01. [REVIEW]Patrick Allo - 2012 - Minds and Machines 22 (1):41-45.
    Download  
     
    Export citation  
     
    Bookmark  
  • Logic in mathematics and computer science.Richard Zach - forthcoming - In Filippo Ferrari, Elke Brendel, Massimiliano Carrara, Ole Hjortland, Gil Sagi, Gila Sher & Florian Steinberger (eds.), Oxford Handbook of Philosophy of Logic. Oxford, UK: Oxford University Press.
    Logic has pride of place in mathematics and its 20th century offshoot, computer science. Modern symbolic logic was developed, in part, as a way to provide a formal framework for mathematics: Frege, Peano, Whitehead and Russell, as well as Hilbert developed systems of logic to formalize mathematics. These systems were meant to serve either as themselves foundational, or at least as formal analogs of mathematical reasoning amenable to mathematical study, e.g., in Hilbert’s consistency program. Similar efforts continue, but have been (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • A Handbook for Language Engineers.Matthew Stone - unknown
    cal practice: the enterprise of specifying information about the world for use in computer systems. Knowledge representation as a field also encompasses conceptual results that call practitioners’ attention to important truths about the world, mathematical results that allow practitioners to make these truths precise, and computational results that put these truths to work. This chapter surveys this practice and its results, as it applies to the interpretation of natural language utterances in implemented natural language processing systems. For a broader perspective (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • Ethics in Artificial Intelligence : How Relativism is Still Relevant.Loukas Piloidis - unknown
    This essay tries to demarcate and analyse Artificial Intelligence ethics. Going away from the traditional distinction in normative, meta, and applied ethics, a different split is executed, inspired by the three most prominent schools of thought: deontology, consequentialism, and Aristotelian virtue ethics. The reason behind this alternative approach is to connect all three schools back to ancient Greek philosophy. Having proven that the majority of arguments derive from some ancient Greek scholars, a new voice is initiated into the discussion, Protagoras (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • Designing Meaningful Agents.Matthew Stone - 2004 - Cognitive Science 28 (5):781-809.
    Download  
     
    Export citation  
     
    Bookmark