Switch to: References

Citations of:

From Logic to Logic Programming

MIT Press (1994)

Add citations

You must login to add citations.
  1. When the (Bayesian) ideal is not ideal.Danilo Fraga Dantas - 2023 - Logos and Episteme 15 (3):271-298.
    Bayesian epistemologists support the norms of probabilism and conditionalization using Dutch book and accuracy arguments. These arguments assume that rationality requires agents to maximize practical or epistemic value in every doxastic state, which is evaluated from a subjective point of view (e.g., the agent’s expectancy of value). The accuracy arguments also presuppose that agents are opinionated. The goal of this paper is to discuss the assumptions of these arguments, including the measure of epistemic value. I have designed AI agents based (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • The Stories of Logic and Information.Johan van Benthem, Maricarmen Martinez, David Israel & John Perry - unknown
    Information is a notion of wide use and great intuitive appeal, and hence, not surprisingly, different formal paradigms claim part of it, from Shannon channel theory to Kolmogorov complexity. Information is also a widely used term in logic, but a similar diversity repeats itself: there are several competing logical accounts of this notion, ranging from semantic to syntactic. In this chapter, we will discuss three major logical accounts of information.
    Download  
     
    Export citation  
     
    Bookmark   17 citations  
  • First-order theories for pure Prolog programs with negation.Robert F. Stärk - 1995 - Archive for Mathematical Logic 34 (2):113-144.
    The standard theory of logic programming is not applicable to Prolog programs even not to pure code. Modifying the theory to take account of reality more is the motivation of this article. For this purpose we introduce the ℓ-completion and the inductive extension of a logic program. Both are first-order theories in a language with operators for success, failure and termination of goals. The ℓ-completion of a logic program is a sound and complete axiomatization of the Prolog depth-first search under (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • A proof-theoretic framework for logic programming.Gerhard Jäger & Robert F. Stärk - 1998 - In Samuel R. Buss (ed.), Handbook of proof theory. New York: Elsevier. pp. 639--682.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Discourse processing in attention-deficit hyperactivity disorder (adhd).Michiel van Lambalgen, Claudia van Kruistum & Esther Parigger - 2008 - Journal of Logic, Language and Information 17 (4):467-487.
    ADHD is a psychiatric disorder characterised by persistent and developmentally inappropriate levels of inattention, impulsivity and hyperactivity. It is known that children with ADHD tend to produce incoherent discourses, e.g. by narrating events out of sequence. Here the aetiology of ADHD becomes of interest. One prominent theory is that ADHD is an executive function disorder, showing deficiencies of planning. Given the close link between planning, verb tense and discourse coherence postulated in van Lambalgen and Hamm (The proper treatment of events, (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • Linguistic $$\leftrightarrow $$ ↔ Rational Agents’ Semantics.Alexander Dikovsky - 2017 - Journal of Logic, Language and Information 26 (4):341-437.
    We define and prove a formal semantics divided into two complementary interacting components: the strictly linguistic semantics, we call linguistic agent, and the strictly logical and referential semantics, we call rational agent. This Linguistic \ Rational Agents’ Semantics applies to Deep Dependency trees or more generally, to discourses, i.e. sequences of DD-trees, and interprets them by functional structures we call Meaning Representation Structures, similar to the DRT, but interpreted very differently. LRA semantics incrementally interprets the discourses by minimal finite models, (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • Merging Observation and Access in Dynamic Logic.Johan van Benthem - unknown
    Rational agents base their actions on information from observation, inference, introspection, or other sources. But this information comes in different kinds, and it is usually handled by different logical mechanisms. We discuss how to integrate external ‘updating information’ and internal ‘elucidating information’ into one system of dynamic epistemic logic, by distinguishing two basic informational actions: ‘bare seeing’ versus ‘conscious realization’.
    Download  
     
    Export citation  
     
    Bookmark   14 citations  
  • Semantic Interpretation as Computation in Nonmonotonic Logic: The Real Meaning of the Suppression Task.Keith Stenning & Michiel Lambalgen - 2005 - Cognitive Science 29 (6):919-960.
    Interpretation is the process whereby a hearer reasons to an interpretation of a speaker's discourse. The hearer normally adopts a credulous attitude to the discourse, at least for the purposes of interpreting it. That is to say the hearer tries to accommodate the truth of all the speaker's utterances in deriving an intended model. We present a nonmonotonic logical model of this process which defines unique minimal preferred models and efficiently simulates a kind of closed-world reasoning of particular interest for (...)
    Download  
     
    Export citation  
     
    Bookmark   20 citations  
  • On the Learnability of Classes of Minimal Grammars With Respect to Some Linear Preordering Relations.Barbara Dziemidowicz-Gryz - 2015 - Studies in Logic, Grammar and Rhetoric 42 (1):37-48.
    In this paper we prove the learnability of the classes of minimal grammars with respect to some linear preorderings on the set of categorial grammars. We give some examples of the linear preordering relations on the set of categorial grammars satisfying necessary conditions.
    Download  
     
    Export citation  
     
    Bookmark  
  • Reasoning in Non-probabilistic Uncertainty: Logic Programming and Neural-Symbolic Computing as Examples.Tarek R. Besold, Artur D’Avila Garcez, Keith Stenning, Leendert van der Torre & Michiel van Lambalgen - 2017 - Minds and Machines 27 (1):37-77.
    This article aims to achieve two goals: to show that probability is not the only way of dealing with uncertainty ; and to provide evidence that logic-based methods can well support reasoning with uncertainty. For the latter claim, two paradigmatic examples are presented: logic programming with Kleene semantics for modelling reasoning from information in a discourse, to an interpretation of the state of affairs of the intended model, and a neural-symbolic implementation of input/output logic for dealing with uncertainty in dynamic (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Fixpoint Semantics for Logic Programming A Survey.Melvin Fitting - unknown
    The variety of semantical approaches that have been invented for logic programs is quite broad, drawing on classical and many-valued logic, lattice theory, game theory, and topology. One source of this richness is the inherent non-monotonicity of its negation, something that does not have close parallels with the machinery of other programming paradigms. Nonetheless, much of the work on logic programming semantics seems to exist side by side with similar work done for imperative and functional programming, with relatively minimal contact (...)
    Download  
     
    Export citation  
     
    Bookmark   18 citations