Balancing Rationality and Utility in Logic-Based Argumentation with Classical Logic Sentences and Belief Contraction

2016 ◽  
pp. 168-180 ◽  
Author(s):  
Ryuta Arisaka ◽  
Ken Satoh
Keyword(s):  
Classical Logic ◽  
Belief Contraction

scholarly journals Belief Update within Propositional Fragments

2018 ◽  
Vol 61 ◽  
pp. 807-834 ◽  
Author(s):  
Nadia Creignou ◽  
Raïda Ktari ◽  
Odile Papini
Keyword(s):  
Knowledge Representation ◽  
Belief Revision ◽  
Classical Logic ◽  
Propositional Logic ◽  
Belief Change ◽  
Research Area ◽  
Belief Contraction ◽  
Belief Merging ◽  
Change Operation ◽  
Horn Fragment

Belief change within the framework of fragments of propositional logic is one of the main and recent challenges in the knowledge representation research area. While previous research works focused on belief revision, belief merging, and belief contraction, the problem of belief update within fragments of classical logic has not been addressed so far. In the context of revision, it has been proposed to refine existing operators so that they operate within propositional fragments, and that the result of revision remains in the fragment under consideration. This approach is not restricted to the Horn fragment but also applicable to other propositional fragments like Krom and affine fragments. We generalize this notion of refinement to any belief change operator. We then focus on a specific belief change operation, namely belief update. We investigate the behavior of the refined update operators with respect to satisfaction of the KM postulates and highlight differences between revision and update in this context.

New method for building ASP knowledge base from knowledge in classical logic

2010 ◽  
Vol 30 (11) ◽  
pp. 2932-2936
Author(s):  
Ling-zhong ZHAO ◽  
Xue-song WANG ◽  
Jun-yan QIAN ◽  
Guo-yong CAI
Keyword(s):  
Knowledge Base ◽  
Classical Logic ◽  
New Method

The Argument from Counterfactuals

2018 ◽  
Author(s):  
Alexander R. Pruss
Keyword(s):  
Natural Law ◽  
Classical Logic ◽  
Divine Command

It seems that counterfactuals and many other statements are subject to semantic underdetermination. Classical logic pushes one to an epistemicist account of this underdetermination, but epistemicism seems implausible. However epistemicism can be made plausible when conjoined with a divine institution account of meaning. This gives us some reason to accept that divine institution account, and hence some reason to think that God exists. This chapter evaluates the arguments for epistemicism and divine institution, including objections, and incorporates Plantinga’s consideration of counterfactuals when it comes to theism. In particular, an analogy is drawn with divine command and natural law theories in ethics.

The 10th IJCAR automated theorem proving system competition – CASC-J10

2021 ◽  
pp. 1-15
Author(s):  
Geoff Sutcliffe
Keyword(s):  
Theorem Proving ◽  
Classical Logic ◽  
Automated Theorem Proving ◽  
Fully Automatic

The CADE ATP System Competition (CASC) is the annual evaluation of fully automatic, classical logic Automated Theorem Proving (ATP) systems. CASC-J10 was the twenty-fifth competition in the CASC series. Twenty-four ATP systems and system variants competed in the various competition divisions. This paper presents an outline of the competition design, and a commentated summary of the results.

Y-Logic: A Framework for Reasoning About Chameleonic Programs with Inconsistent Completions

1990 ◽  
Vol 13 (4) ◽  
pp. 465-483
Author(s):  
V.S. Subrahmanian
Keyword(s):  
Classical Logic ◽  
Logic Program ◽  
Logic Programs ◽  
Large Subset ◽  
General Logic ◽  
Traditional Sense

Large logic programs are normally designed by teams of individuals, each of whom designs a subprogram. While each of these subprograms may have consistent completions, the logic program obtained by taking the union of these subprograms may not. However, the resulting program still serves a useful purpose, for a (possibly) very large subset of it still has a consistent completion. We argue that “small” inconsistencies may cause a logic program to have no models (in the traditional sense), even though it still serves some useful purpose. A semantics is developed in this paper for general logic programs which ascribes a very reasonable meaning to general logic programs irrespective of whether they have consistent (in the classical logic sense) completions.

scholarly journals On Correspondence between Selective CPS Transformation and Selective Double Negation Translation

Mathematics ◽  
2021 ◽  
Vol 9 (4) ◽  
pp. 385
Author(s):  
Hyeonseung Im
Keyword(s):  
Programming Languages ◽  
Intuitionistic Logic ◽  
Reference Point ◽  
Classical Logic ◽  
Proof System ◽  
Double Negation

A double negation translation (DNT) embeds classical logic into intuitionistic logic. Such translations correspond to continuation passing style (CPS) transformations in programming languages via the Curry-Howard isomorphism. A selective CPS transformation uses a type and effect system to selectively translate only nontrivial expressions possibly with computational effects into CPS functions. In this paper, we review the conventional call-by-value (CBV) CPS transformation and its corresponding DNT, and provide a logical account of a CBV selective CPS transformation by defining a selective DNT via the Curry-Howard isomorphism. By using an annotated proof system derived from the corresponding type and effect system, our selective DNT translates classical proofs into equivalent intuitionistic proofs, which are smaller than those obtained by the usual DNTs. We believe that our work can serve as a reference point for further study on the Curry-Howard isomorphism between CPS transformations and DNTs.

scholarly journals Traditional Logic and Computational Thinking

Philosophies ◽  
2021 ◽  
Vol 6 (1) ◽  
pp. 12
Author(s):  
J.-Martín Castro-Manzano
Keyword(s):  
Logic Programming ◽  
Classical Logic ◽  
Computational Thinking ◽  
Traditional Logic ◽  
Aristotelian Logic

In this contribution, we try to show that traditional Aristotelian logic can be useful (in a non-trivial way) for computational thinking. To achieve this objective, we argue in favor of two statements: (i) that traditional logic is not classical and (ii) that logic programming emanating from traditional logic is not classical logic programming.

Sign in / Sign up

Export Citation Format

Share Document