Filters








124,510 Hits in 6.5 sec

Page 790 of Mathematical Reviews Vol. , Issue 2002B [page]

2002 Mathematical Reviews  
) Dynamic argument systems: a formal model of argumentation processes based on situation calculus.  ...  Section 6 investigates argumentation with dy- namic rules of order and introduces dynamic argument systems in which metalevel debates are possible.  ... 

A Proof-Checker for Dynamic Logic

Steven D. Litvintchouk, Vaughan R. Pratt
1977 International Joint Conference on Artificial Intelligence  
Dynamic logic is more closely related to classical first-order logic than any other proposed logic of programs. This simplifies the design of a proof-checker for dynamic logic.  ...  We consider the problem of getting a computer to follow reasoning conducted in dynamic logic.  ...  Acknowledgments David Harel and Albert Meyer made substantial contributions to the theoretical underpinnings of dynamic logic.  ... 
dblp:conf/ijcai/LitvintchoukP77 fatcat:pcyvi6sujfdxxjabbbxhyyvsie

Deductive Argumentation by Enhanced Sequent Calculi and Dynamic Derivations

Ofer Arieli, Christian Straßer
2016 Electronical Notes in Theoretical Computer Science  
elimination rules, and deductions are made by dynamic proof systems extending standard sequent calculi.  ...  The goal of this paper is to provide an abstract, proof theoretical investigation of logical argumentation, where arguments are represented by sequents, conflicts between arguments are represented by sequent  ...  The non-monotonic nature of its derivations resembles other dynamic proof systems in other contexts, such as adaptive logics [7, 21] .  ... 
doi:10.1016/j.entcs.2016.06.003 fatcat:toss53yuyzgepnd6gfyxpcwxui

Defeasible logic with dynamic priorities

Grigoris Antoniou
2004 International Journal of Intelligent Systems  
Dynamic priorities have been studied for other related reasoning systems, such as default logic and argumentation.  ...  We define a proof theory, study its formal properties, and provide an argumentation semantics.  ...  DDL1: Dynamic Defeasible Logic without Cycle Checking Proof Theory A conclusion of a defeasible theory D consists of a sign, a tag, and a literal.  ... 
doi:10.1002/int.20008 fatcat:u6quwxxtkfhafetjp5vddv3lyi

Program certification with computational effects [article]

Jean-Guillaume Dumas and Dominique Duval and Burak Ekici and Damien Pous
2014 arXiv   pre-print
In this paper, we pesent a proof system for exceptions which involves both raising and handling, by extending Moggi's approach based on monads.  ...  A way to implement dynamic evaluation in modern computing languages is to use the exceptions mechanism provided by the language.  ...  This means that exceptional arguments are treated by [f, g] as they would be by g.  ... 
arXiv:1411.7140v1 fatcat:ixrqc2qbyfa3lbgxbuitpyice4

Foundational proof checkers with small witnesses

Dinghao Wu, Andrew W. Appel, Aaron Stump
2003 Proceedings of the 5th ACM SIGPLAN international conference on Principles and practice of declaritive programming - PPDP '03  
Proof checkers for proof-carrying code (and similar) systems can suffer from two problems: huge proof witnesses and untrustworthy proof rules.  ...  We show the theory, design, and implementation of a proof-checker that permits small proof witnesses and machine-checkable proofs of the soundness of the system.  ...  Dynamic clauses and local assumptions Many logic programming systems provide a facility for managing dynamic clauses at run time.  ... 
doi:10.1145/888251.888276 dblp:conf/ppdp/WuAS03 fatcat:by4aj4yjlvg5tg34g3ssccwawy

OUP accepted manuscript

2018 Journal of Logic and Computation  
As a by-product of this we obtain soundness and completeness results for the dynamic proof systems with respect to several of Dung's semantics.  ...  In a broader context, we believe that this work helps to better understand and evaluate the role of logic-based instantiations of argumentation frameworks.  ...  Acknowledgements The first two authors are supported by the Israel Science Foundation (grant 817/15), and the last two authors are supported by the Alexander von Humboldt Foundation and the German Ministry  ... 
doi:10.1093/logcom/exy027 fatcat:ctjusssoa5hg7ejvtvcapuejxu

Resource Adaptive Agents in Interactive Theorem Proving [article]

Christoph Benzmueller, Volker Sorge
2009 arXiv   pre-print
Experiments with this approach show that its effectiveness can be further improved by introducing a resource concept.  ...  The mechanism uses a two layered architecture of agent societies to suggest appropriate commands together with possible command argument instantiations.  ...  ratings of argument agents to be dynamically adjusted by the system itself.  ... 
arXiv:0901.3585v1 fatcat:tb3h3qqk4japhf7xeacoyda45i

Critical Agents Supporting Interactive Theorem Proving [chapter]

Christoph Benzmüller, Volker Sorge
1999 Lecture Notes in Computer Science  
We introduce a resource adaptive agent mechanism which supports the user of an interactive theorem proving system.  ...  Experiments with this approach show that its e ectiveness can be further improved by i n troducing a resource concept.  ...  complexity ratings of argument agents to be dynamically adjusted by the system itself.  ... 
doi:10.1007/3-540-48159-1_15 fatcat:26oh7zrayvbwxmd35e5jqvyidq

"Platonic" thought experiments: how on earth?

Rafal Urbaniak
2011 Synthese  
and cannot even be represented by arguments.  ...  I argue against this approach by describing how "platonic" TEs can be modeled within the logical framework of adaptive proofs for prioritized consequence operations.  ...  , governed by one formal logical system.  ... 
doi:10.1007/s11229-011-0008-4 fatcat:ifscsikglva5lpjphimg63yevm

An Argument for Systems Grammar

John W. Oller, Jr.
2011 International Journal of Linguistics  
The point of this paper is that a dynamic systems grammar-the sort that takes valid account of particular persons, bodily entities, events, and the dynamic relations between them is required.  ...  and its ordinary meaningful uses by the various communities of the world?  ...  Peirce explains that the logic of relatives makes possible a dynamic view of systems as they change over time.  ... 
doi:10.5296/ijl.v3i1.624 fatcat:nbdzedimsfbupc4aybbx2pql2i

The AProS Project: Strategic Thinking & Computational Logic

W. Sieg
2007 Logic Journal of the IGPL  
The paper discusses tools for teaching logic used in Logic & Proofs, a web-based introduction to modern logic that has been taken by more than 1,300 students since the fall of 2003.  ...  The intellectual context includes i) the theoretical background for the proof search algorithm AProS and its use for a dynamic Proof Tutor, and ii) the programmatic expansion of the course to Computational  ...  His systems use exclusively elimination and introduction rules for the logical connectives and have the further distinctive feature of allowing assumptions in arguments.  ... 
doi:10.1093/jigpal/jzm026 fatcat:wgf66qtnrvb2doksuly24dgoda

A Complete Axiomatization of Quantified Differential Dynamic Logic for Distributed Hybrid Systems

Andre Platzer, Helmut Veith
2012 Logical Methods in Computer Science  
We introduce a dynamic logic for verifying distributed hybrid systems and present a proof calculus for this logic. This is the first formal verification approach for distributed hybrid systems.  ...  We provide the logical foundations for closing this analytic gap. We develop a formal model for distributed hybrid systems.  ...  , structural, and dimension-changing dynamics. • We introduce a specification and verification logic for (dynamic) distributed hybrid systems. • We present a proof calculus for this logic, which, to the  ... 
doi:10.2168/lmcs-8(4:17)2012 fatcat:hrl4w5deb5hwhk42fw4n2zwrby

The nets of reason

Johan van Benthem
2012 Argument & Computation  
Gabbay's networks unify across different fields, from logic programmes to dynamical systems.  ...  Logic and argumentation are a natural combination.  ...  We could call this the view of logic in networks. But conversely, networks can also be described externally by logical languages (cf. Kremer and Mints (2007) on modal logics of dynamical systems).  ... 
doi:10.1080/19462166.2012.704400 fatcat:fftwc5wykbdphdjdpymmsarecu

Page 9553 of Mathematical Reviews Vol. , Issue 2004m [page]

2004 Mathematical Reviews  
simulated by short bounded depth proofs in a Frege system with a parity counting connective.  ...  For example, the usual textbook calculus for propositional logic (the so-called Frege system) is “strong” in this context. One such suggestion has been made by S. A.  ... 
« Previous Showing results 1 — 15 out of 124,510 results