Mostrando recursos 1 - 20 de 1.072

  1. Entimemas probatorios

    Bonorino, Pablo
    En este trabajo se abordan dos problemas relacionados con los entimemas (entendidos como argumentos incompletos) formulados en procedimientos penales para apoyar la verdad de un enunciado fáctico: (1) ¿Cómo se puede justificar la atribución de un enunciado a un texto que no lo contiene?, y (2) ¿Cómo se puede escoger la premisa tácita a incorporar durante la reconstrucción cuando el texto admite más de una interpretación? Se rechazan dos variantes de deductivismo (ingenua y sofisticada) por no ser capaces de responder a sus críticos sin abandonar su compromiso con la lógica deductiva. Se defiende un modelo interpretativo como alternativa, basado...

  2. Pure Extensions, Proof Rules, and Hybrid

    Patrick Blackburn; Balder Ten Cate
    In this paper we argue that hybrid logic is the deductive setting most natural for Kripke semantics. We do so by investigating hybrid axiomatics for a variety of systems, ranging from the basic hybrid language (a decidable system with the same complexity as orthodox propositional modal logic) to the strong Priorean language (which offers full first-order expressivity). We show that hybrid logic offers a genuinely first-order perspective on Kripke semantics: it is possible to define base logics which extend automatically to a wide variety of frame classes and to prove completeness using the Henkin method. In the weaker languages, this...


    Jack L. Krogstad; Jack L. Krogstad
    itz, and Sterling emphasize the central importance of fundamental propositions in accounting theory construction. Theory building in accounting has proceeded, however, without the insight provided by delineation of the respective natures and functions germane to differ-ent types of fundamental propositions. Accounting theorists have not gone far enough in identifying the unique roles of the various state-ments used as basic assumptions in theory construction. Accordingly, premises, axioms, and postulates are differentiated in harmony with philosophic substance. Premises are closely linked to systems of formal deductive logic and the inherent processes of valid inference. Axioms are used in theoretical systems to specify...

  4. U.: Uncertainty and partial non-uniform assumptions in parametric deductive databases

    Yann Loyer; Umberto Straccia
    Abstract. Different many-valued logic programming frameworks have been proposed to manage uncertain information in deductive databases and logic programming. A feature of these frameworks is that they rely on a predefined assumption or hypothesis, i.e. an interpretation that assigns the same default truth value to all the atoms of a program, e.g. in the open world assumption, by default all atoms have unknown truth value. In this paper we extend these frameworks along three directions: (i) we will introduce non-monotonic modes of negation; (ii) the default truth values of atoms need not necessarily to be all equal each other; and...

  5. Uncertainty and a 7-Valued Logic

    Ulisses Ferreira; Http://www. Ufba. Br; Escola Politécnica; Av. Caetano Moura; Bahia Brazil
    Abstract — Uncertainty is a research topic which has not only been well known to the AI community but also, more recently, in the programming languages community at some extent. This paper joins the well known uncertainty model of MYCIN, extended, with a seven-valued deductive logic introduced here, working towards the unification of two different forms of representation, and of reasons, as humans always do. This seven-valued logic is introduced by myself as a novelty, here in the present paper, after having proposed a similar but simplified five-valued logic and a system, but this seven-valued logic is fully compatible with...


    Branden Fitelson
    Abstract. First, a brief historical trace of the developments in confirmation theory leading up to Goodman’s infamous “grue ” paradox is presented. Then, Goodman’s argument is analyzed from both Hempelian and Bayesian perspectives. A guiding analogy is drawn between certain arguments against classical deductive logic, and Goodman’s “grue ” argument against classical inductive logic. The upshot of this analogy is that the “New Riddle ” is not as vexing as many commentators have claimed (especially, from a Bayesian inductive-logical point of view). Specifically, the analogy reveals an intimate connection between Goodman’s problem, and the “problem of old evidence”. Several other...

  7. A knowledge representation framework based on autoepistemic logic of minimal beliefs

    Teodor Przymusinski
    We introduce a uniform non-monotonic framework for knowledge representation based on epistemic logic which is sufficiently general to encompass several non-monotonic formalisms, including circumscription, autoepistemic logic, various semantics proposed for logic programs and deductive databases (stable semantics, well-founded semantics and stationary semantics) as well as Gelfond’s epistemic specifications. The existence of such a uniform framework allows us not only to provide simpler and perhaps more natural definitions of various formalisms but it also enables us to better understand mutual relationships existing between them.

  8. INFORMAL LOGIC XVI.3, Fall 1994 The Deductive/Inductive Distinction*

    George Bowles
    Abstract: In this paper I examine five distinc-tions between deductive and inductive arguments, concluding that the best of the five defines a de-ductive argument as one in which conclusive favorable relevance to its conclusion is attrib-uted to its premises, and an inductive argument as any argument that is not deductive. This dis-tinction, unlike its rivals, is both exclusive and exhaustive; permits both good and bad arguments of each kind; and is both useful and needed in evaluating at least some arguments. In past years a debate flourished con-cerning the content and value of the dis-tinction between deductive and inductive arguments....

  9. Synthesizing database transactions

    Xiaolei Qian
    Database programming requires having the knowledge of database semantics both to maintain database integrity and to explore more optimization opportunities. Automated pro-gramming of database transactions is desirable and feasible. In general, transactions use simple constructs and algorithms; specifications of database semantics are available; and trans-actions perform small incremental updates to database con-tents. Automated programming in such a restricted but well-understood and important domain is promising. We approach the synthesis of database transactions that preserve the validity of integrity constraints using deductive tachniques. A transaction logic is developed as the formalism with which the synthesis is conducted. Transactions are gen-erated as...

  10. Validity, paradox, and the ideal of deductive logic Contents

    Thomas Hofweber

  11. Active Logic, Labeled Deductive Systems, reasoning with limited resources Reasoning with Limited Resources: Active Logics Expressed as Labeled Deductive Systems

    Reasoning with limited computational resources (such as time or memory) is an important problem, in particular in knowledge-intensive embedded systems. Classical logic is usually considered inapropriate for this purpose as no guarantees regarding deadlines can be made. One of the more interesting approaches to address this problem is built around the concept of active logics. Although a step in the right direction, active logics still do not offer the ultimate solution. Our work is based on the assumption that Labeled Deductive Systems offer appropriate metamathematical methodology to study the problem. As a first step, we have reformulated a pair of...


    Barry Nurcombe; Ina Fitzhenry-coor
    Information-processing research into the natural process of clinical reasoning is reviewed and the University of Vermont diagnostic reasoning research project is described. Experienced psychiatric diagnosticians use a hypothetico-deductive logic. The development of a profile of diagnostic competencies is outlined and a course in diagnostic reasoning for medical students, which specifically objectified the tactics and strategy of reasoning and resulted in a significant improvement in the profile of competencies, is described. Finally, the organisation of a diagnostic formulation is discussed. It is hard to think about thinking. No wonder, then, that research into clinical reasoning has been impeded by obstacles and...

  13. Pure Extensions, Proof Rules, and Hybrid Axiomatics

    Blackburn, Patrick; Ten Cate, Balder
    In this paper we argue that hybrid logic is the deductive setting most natural for Kripke semantics. We do so by investigating hybrid axiomatics for a variety of systems, ranging from the basic hybrid language (a decidable system with the same complexity as orthodox propositional modal logic) to the strong Priorean language (which offers full first-order expressivity). We show that hybrid logic offers a genuinely first-order perspective on Kripke semantics: it is possible to define base logics which extend automatically to a wide variety of frame classes and to prove completeness using the Henkin method. In the weaker languages, this...

  14. FCSH

    David Botting; Waller Waller Guarini
    Abstract: I will show that there is a type of analogical reasoning that instantiates a pattern of reasoning in confirmation theory that is con-sidered at best paradoxical and at worst fatal to the entire syntactical approach to confirmation and ex-planation. However, I hope to elabo-rate conditions under which this is a sound (although not necessarily strong) method of reasoning. It does not, as its exponents claim, instanti-ate a pattern of reasoning distinct from deductive and inductive logic.

  15. Multiple Revision on Horn Belief Bases

    Valdez, Néstor Jorge; Falappa, Marcelo Alejandro
    In logic programming, Horn clauses play a basic role, and in many logical constructs their consideration is important. In this paper we study the multiple revision of a belief base where the underlying logic is composed by Horn clauses. The main di culties as to restricting to the Horn fragment for revision operators by a single sentence are analyzed, and general results are presented about multiple revision operators on belief bases. We de ne prioritized multiple revision operators under a more restricted logic than classical propositional logic, i.e. Horn logic. We propose a set of postulates and representation theorems for each...

  16. Finitary Partial Inductive Definitions and General Logic

    Lars-henrik Eriksson
    Abstract. We describe how the calculus of partial inductive definitions is used to represent logics. This calculus includes the powerful principle of definitional reflection. We describe two conceptually different approaches to representing a logic, both making essential use of definitional reflection. In the deductive approach, the logic is defined by its inference rules. Only the succedent rules (in a sequent calculus setting – introduction rules in a natural deduction setting) need be given. The other rules are obtained implicitly using definitional reflection. In the semantic approach, the logic is defined using its valuation function. The latter approach often provides a...

  17. Christianity: A Critique of the Rational Choice Theory of Religion from a Weberian and Comparative Religions Perspective

    Stephen Sharot
    The rational choice theorists of religion have attempted to build upa body of transcultural, universalistic generalizations, be~nning with basic axioms ofhuman rationality. The problematics of the perspective's analytical focus on one type of rationality are ma & evident by a comparison u,ith Max Weber's types of action. The influence of the American reli~ous experience is evident in the perspective's formulations and explanations, and conceptual and theoretŸ problems arise when th perspective is applied to non.westem reli~on. The relationstª between otherwor/d/:y rewards and supernatural beings proposed by the theory has to bemodified with respect o eastem religions. Monopolista and pluralism take...

  18. Automation of Program Synthesis from Logic-Based Specifications in the Deductive

    Yulia S. Korukhova; Postgraduate Student
    In [Manna and Waldinger, 1992] the deductive tableau method was proposed. It is appropriate for the synthesis of functional programs. The specification of a program is taken as a mathematical existence theorem and we prove the existence of an object that satisfies the specified conditions. Specification is based on predicate-logic, because it is quite general and appropriate for deductive methods. If other

  19. UMCS-92-11-2 Towards a Formal Framework for Deductive Synthesis of Logic Programs UMCS-92-11-1 Topic in Type Theory UMCS-92-6-2 Declarative Integration of Object-Oriented Programming and Knowledge Representation £10.00

    Ian K. Piumarta; Umcs--- Knowledge-based; Umcs--- An; Object-based Design; Method Concurrent Programs
    your order. Payment should be made by sterling cheque made payable to ‘The University of Manchester.’ The following reports are available free of charge, unless otherwise stated: UMCS-93-2-3 A Framework for Experimental Analysis of Parallel Computing


    Bertil Rolf
    Whatever the nature of reasoning skills, such skills are rare [4], [2]. Thus, it would be desirable to develop support for them and to cultivate and strengthen them through proper education in reasoning. The background for my discussion is the development of support for reasoning skills that our research team has been conducting for some time ( Design of support or education for reasoning depends on concepts of reasoning skills. The essence of reasoning is to construct or evaluate relations of dependence. If D can be proved from A, B and C, there is a logical dependence between these items....

Aviso de cookies: Usamos cookies propias y de terceros para mejorar nuestros servicios, para análisis estadístico y para mostrarle publicidad. Si continua navegando consideramos que acepta su uso en los términos establecidos en la Política de cookies.