Switch to: References

Add citations

You must login to add citations.
  1. 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  
  • On the computational complexity of ethics: moral tractability for minds and machines.Jakob Stenseke - 2024 - Artificial Intelligence Review 57 (105):90.
    Why should moral philosophers, moral psychologists, and machine ethicists care about computational complexity? Debates on whether artificial intelligence (AI) can or should be used to solve problems in ethical domains have mainly been driven by what AI can or cannot do in terms of human capacities. In this paper, we tackle the problem from the other end by exploring what kind of moral machines are possible based on what computational systems can or cannot do. To do so, we analyze normative (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • Metric dynamic equilibrium logic.Arvid Becker, Pedro Cabalar, Martín Diéguez, Luis Farinas del Cerro, Torsten Schaub & Anna Schuhmann - 2023 - Journal of Applied Non-Classical Logics 33 (3-4):495-519.
    1. Reasoning about action and change, or more generally reasoning about dynamic systems, is not only central to knowledge representation and reasoning but at the heart of computer science (Fisher e...
    Download  
     
    Export citation  
     
    Bookmark  
  • Truths about Simpson's Paradox - Saving the Paradox from Falsity.Don Dcruz, Prasanta S. Bandyopadhyay, Venkata Raghavan & Gordon Brittain Jr - 2015 - In M. Banerjee & S. N. Krishna (eds.), LNCS 8923. pp. 58-75.
    There are three questions associated with Simpson’s paradox (SP): (i) Why is SP paradoxical? (ii) What conditions generate SP? and (iii) How to proceed when confronted with SP? An adequate analysis of the paradox starts by distinguishing these three questions. Then, by developing a formal account of SP, and substantiating it with a counterexample to causal accounts, we argue that there are no causal factors at play in answering questions (i) and (ii). Causality enters only in connection with action.
    Download  
     
    Export citation  
     
    Bookmark  
  • From positive PDL to its non-classical extensions.Igor Sedlár & Vít Punčochář - 2019 - Logic Journal of the IGPL 27 (4):522-542.
    We provide a complete binary implicational axiomatization of the positive fragment of propositional dynamic logic. The intended application of this result are completeness proofs for non-classical extensions of positive PDL. Two examples are discussed in this article, namely, a paraconsistent extension with modal De Morgan negation and a substructural extension with the residuated operators of the non-associative Lambek calculus. Informal interpretations of these two extensions are outlined.
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • Effective finite-valued approximations of general propositional logics.Matthias Baaz & Richard Zach - 2008 - In Arnon Avron & Nachum Dershowitz (eds.), Pillars of Computer Science: Essays Dedicated to Boris (Boaz) Trakhtenbrot on the Occasion of His 85th Birthday. Springer Verlag. pp. 107–129.
    Propositional logics in general, considered as a set of sentences, can be undecidable even if they have “nice” representations, e.g., are given by a calculus. Even decidable propositional logics can be computationally complex (e.g., already intuitionistic logic is PSPACE-complete). On the other hand, finite-valued logics are computationally relatively simple—at worst NP. Moreover, finite-valued semantics are simple, and general methods for theorem proving exist. This raises the question to what extent and under what circumstances propositional logics represented in various ways can (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • A Modal Logic and Hyperintensional Semantics for Gödelian Intuition.David Elohim - manuscript
    This essay aims to provide a modal logic for rational intuition. Similarly to treatments of the property of knowledge in epistemic logic, I argue that rational intuition can be codified by a modal operator governed by the modal $\mu$-calculus. Via correspondence results between fixed point modal propositional logic and the bisimulation-invariant fragment of monadic second-order logic, a precise translation can then be provided between the notion of 'intuition-of', i.e., the cognitive phenomenal properties of thoughts, and the modal operators regimenting the (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • Logical and Epistemic Modality.David Elohim - manuscript
    This paper examines the interaction between the philosophy and psychology of concepts and the modal characterization of the deductive concept of logical validity. The concept of logical consequence on which I focus is model-theoretic, where the concept records the property of necessary truth-preservation from the premise of an argument to its conclusion, as well as the condition that, in the class of all possible worlds in which a premise is true, a consequent formula or succedent class of formulas is true, (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • (1 other version)Strong Completeness and Limited Canonicity for PDL.Gerard Renardel de Lavalette, Barteld Kooi & Rineke Verbrugge - 2009 - Journal of Logic, Language and Information 18 (2):291-292.
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • (1 other version)Forms of Luminosity: Epistemic Modality and Hyperintensionality in Mathematics.David Elohim - 2017 - Dissertation, Arché, University of St Andrews
    This book concerns the foundations of epistemic modality and hyperintensionality and their applications to the philosophy of mathematics. David Elohim examines the nature of epistemic modality, when the modal operator is interpreted as concerning both apriority and conceivability, as well as states of knowledge and belief. The book demonstrates how epistemic modality and hyperintensionality relate to the computational theory of mind; metaphysical modality and hyperintensionality; the types of mathematical modality and hyperintensionality; to the epistemic status of large cardinal axioms, undecidable (...)
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  • (1 other version)Forms of Luminosity: Epistemic Modality and Hyperintensionality in Mathematics.David Elohim - 2017
    This book concerns the foundations of epistemic modality and hyperintensionality and their applications to the philosophy of mathematics. David Elohim examines the nature of epistemic modality, when the modal operator is interpreted as concerning both apriority and conceivability, as well as states of knowledge and belief. The book demonstrates how epistemic modality and hyperintensionality relate to the computational theory of mind; metaphysical modality and hyperintensionality; the types of mathematical modality and hyperintensionality; to the epistemic status of large cardinal axioms, undecidable (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • A Computational Learning Semantics for Inductive Empirical Knowledge.Kevin T. Kelly - 2014 - In Alexandru Baltag & Sonja Smets (eds.), Johan van Benthem on Logic and Information Dynamics. Cham, Switzerland: Springer International Publishing. pp. 289-337.
    This chapter presents a new semantics for inductive empirical knowledge. The epistemic agent is represented concretely as a learner who processes new inputs through time and who forms new beliefs from those inputs by means of a concrete, computable learning program. The agent’s belief state is represented hyper-intensionally as a set of time-indexed sentences. Knowledge is interpreted as avoidance of error in the limit and as having converged to true belief from the present time onward. Familiar topics are re-examined within (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • Mathematical modal logic: A view of its evolution.Robert Goldblatt - 2003 - Journal of Applied Logic 1 (5-6):309-392.
    Download  
     
    Export citation  
     
    Bookmark   57 citations  
  • Paraconsistent dynamics.Patrick Girard & Koji Tanaka - 2016 - Synthese 193 (1):1-14.
    It has been an open question whether or not we can define a belief revision operation that is distinct from simple belief expansion using paraconsistent logic. In this paper, we investigate the possibility of meeting the challenge of defining a belief revision operation using the resources made available by the study of dynamic epistemic logic in the presence of paraconsistent logic. We will show that it is possible to define dynamic operations of belief revision in a paraconsistent setting.
    Download  
     
    Export citation  
     
    Bookmark   11 citations  
  • Conditionals, Meaning, and Mood.William Starr - 2010 - Dissertation, Rutgers University
    This work explores the hypothesis that natural language is a tool for changing a language user's state of mind and, more specifically, the hypothesis that a sentence's meaning is constituted by its characteristic role in fulfilling this purpose. This view contrasts with the dominant approach to semantics due to Frege, Tarski and others' work on artificial languages: language is first and foremost a tool for representing the world. Adapted to natural language by Davidson, Lewis, Montague, et. al. this dominant approach (...)
    Download  
     
    Export citation  
     
    Bookmark   15 citations  
  • What 'If'?William B. Starr - 2014 - Philosophers' Imprint 14.
    No existing conditional semantics captures the dual role of 'if' in embedded interrogatives — 'X wonders if p' — and conditionals. This paper presses the importance and extent of this challenge, linking it to cross-linguistic patterns and other phenomena involving conditionals. Among these other phenomena are conditionals with multiple 'if'-clauses in the antecedent — 'if p and if q, then r' — and relevance conditionals — 'if you are hungry, there is food in the cupboard'. Both phenomena are shown to (...)
    Download  
     
    Export citation  
     
    Bookmark   15 citations  
  • (1 other version)Strong Completeness and Limited Canonicity for PDL.Gerard Renardel de Lavalette, Barteld Kooi & Rineke Verbrugge - 2008 - Journal of Logic, Language and Information 17 (1):69-87.
    Propositional dynamic logic is complete but not compact. As a consequence, strong completeness requires an infinitary proof system. In this paper, we present a short proof for strong completeness of $$\mathsf{PDL}$$ relative to an infinitary proof system containing the rule from [α; β n ]φ for all $$n \in {\mathbb{N}}$$, conclude $$[\alpha;\beta^*] \varphi$$. The proof uses a universal canonical model, and it is generalized to other modal logics with infinitary proof rules, such as epistemic knowledge with common knowledge. Also, we (...)
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • Reducing dynamic epistemic logic to pdl by program transformation.Jan van Eijck - unknown
    We present a direct reduction of dynamic epistemic logic in the spirit of [4] to propositional dynamic logic (PDL) [17, 18] by program transformation. The program transformation approach associates with every update action a transformation on PDL programs. These transformations are then employed in reduction axioms for the update actions. It follows that the logic of public announcement, the logic of group announcements, the logic of secret message passing, and so on, can all be viewed as subsystems of PDL. Moreover, (...)
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • Combining Montague semantics and discourse representation.Reinhard Muskens - 1996 - Linguistics and Philosophy 19 (2):143 - 186.
    This paper embeds the core part of Discourse Representation Theory in the classical theory of types plus a few simple axioms that allow the theory to express key facts about variables and assignments on the object level of the logic. It is shown how the embedding can be used to combine core analyses of natural language phenomena in Discourse Representation Theory with analyses that can be obtained in Montague Semantics.
    Download  
     
    Export citation  
     
    Bookmark   92 citations  
  • Bewirken.Franz von Kutschera - 1986 - Erkenntnis 24 (3):253 - 281.
    Download  
     
    Export citation  
     
    Bookmark   26 citations  
  • Johan van Benthem on Logic and Information Dynamics.Alexandru Baltag & Sonja Smets (eds.) - 2014 - Cham, Switzerland: Springer International Publishing.
    This book illustrates the program of Logical-Informational Dynamics. Rational agents exploit the information available in the world in delicate ways, adopt a wide range of epistemic attitudes, and in that process, constantly change the world itself. Logical-Informational Dynamics is about logical systems putting such activities at center stage, focusing on the events by which we acquire information and change attitudes. Its contributions show many current logics of information and change at work, often in multi-agent settings where social behavior is essential, (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • BDD-based decision procedures for the modal logic K ★.Guoqiang Pan, Ulrike Sattler & Moshe Y. Vardi - 2006 - Journal of Applied Non-Classical Logics 16 (1-2):169-207.
    We describe BDD-based decision procedures for the modal logic K. Our approach is inspired by the automata-theoretic approach, but we avoid explicit automata construction. Instead, we compute certain fixpoints of a set of types — which can be viewed as an on-the-fly emptiness of the automaton. We use BDDs to represent and manipulate such type sets, and investigate different kinds of representations as well as a “level-based” representation scheme. The latter turns out to speed up construction and reduce memory consumption (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • Dynamic non-commutative logic.Norihiro Kamide - 2010 - Journal of Logic, Language and Information 19 (1):33-51.
    A first-order dynamic non-commutative logic, which has no structural rules and has some program operators, is introduced as a Gentzen-type sequent calculus. Decidability, cut-elimination and completeness theorems are shown for DN or its fragments. DN is intended to represent not only program-based, resource-sensitive, ordered, sequence-based, but also hierarchical reasoning.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • On the decision problem for two-variable first-order logic.Erich Grädel, Phokion G. Kolaitis & Moshe Y. Vardi - 1997 - Bulletin of Symbolic Logic 3 (1):53-69.
    We identify the computational complexity of the satisfiability problem for FO 2 , the fragment of first-order logic consisting of all relational first-order sentences with at most two distinct variables. Although this fragment was shown to be decidable a long time ago, the computational complexity of its decision problem has not been pinpointed so far. In 1975 Mortimer proved that FO 2 has the finite-model property, which means that if an FO 2 -sentence is satisfiable, then it has a finite (...)
    Download  
     
    Export citation  
     
    Bookmark   36 citations  
  • Reasoning About Games.Melvin Fitting - 2011 - Studia Logica 99 (1-3):143-169.
    is used to give a formalization of Artemov’s knowledge based reasoning approach to game theory, (KBR), [ 4 , 5 ]. Epistemic states of players are represented explicitly and reasoned about formally. We give a detailed analysis of the Centipede game using both proof theoretic and semantic machinery. This helps make the case that PDL + E can be a useful basis for the logical investigation of game theory.
    Download  
     
    Export citation  
     
    Bookmark   6 citations  
  • Reasoning about action and change.Helmut Prendinger & Gerhard Schurz - 1996 - Journal of Logic, Language and Information 5 (2):209-245.
    Reasoning about change is a central issue in research on human and robot planning. We study an approach to reasoning about action and change in a dynamic logic setting and provide a solution to problems which are related to the Frame problem. Unlike most work on the frame problem the logic described in this paper is monotonic. It (implicitly) allows for the occurrence of actions of multiple agents by introducing non-stationary notions of waiting and test. The need to state a (...)
    Download  
     
    Export citation  
     
    Bookmark   6 citations  
  • Freedom and Enforcement in Action: A Study in Formal Action Theory.Janusz Czelakowski - 2015 - Dordrecht, Netherland: Springer.
    Situational aspects of action are discussed. The presented approach emphasizes the role of situational contexts in which actions are performed. These contexts influence the course of an action; they are determined not only by the current state of the system but also shaped by other factors as time, the previously undertaken actions and their succession, the agents of actions and so on. The distinction between states and situations is explored from the perspective of action systems. The notion of a situational (...)
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • Modal logic: A semantic perspective.Patrick Blackburn & Johan van Benthem - 1988 - Ethics 98:501-517.
    . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 2 2 BASIC MODAL LOGIC . . . . . . . . . . . . . . . . . . . . . . . . . . . 3.
    Download  
     
    Export citation  
     
    Bookmark   39 citations  
  • Term-modal logics.Melvin Fitting, Lars Thalmann & Andrei Voronkov - 2001 - Studia Logica 69 (1):133-169.
    Many powerful logics exist today for reasoning about multi-agent systems, but in most of these it is hard to reason about an infinite or indeterminate number of agents. Also the naming schemes used in the logics often lack expressiveness to name agents in an intuitive way.To obtain a more expressive language for multi-agent reasoning and a better naming scheme for agents, we introduce a family of logics called term-modal logics. A main feature of our logics is the use of modal (...)
    Download  
     
    Export citation  
     
    Bookmark   14 citations  
  • Logics for epistemic programs.Alexandru Baltag & Lawrence S. Moss - 2004 - Synthese 139 (2):165 - 224.
    We construct logical languages which allow one to represent a variety of possible types of changes affecting the information states of agents in a multi-agent setting. We formalize these changes by defining a notion of epistemic program. The languages are two-sorted sets that contain not only sentences but also actions or programs. This is as in dynamic logic, and indeed our languages are not significantly more complicated than dynamic logics. But the semantics is more complicated. In general, the semantics of (...)
    Download  
     
    Export citation  
     
    Bookmark   117 citations  
  • Getting started: Beginnings in the logic of action.Krister Segerberg - 1992 - Studia Logica 51 (3-4):347 - 378.
    A history of the logic of action is outlined, beginning with St Anselm. Five modern authors are discussed in some detail: von Wright, Fitch, Kanger, Chellas and Pratt.
    Download  
     
    Export citation  
     
    Bookmark   46 citations  
  • Inquisitive Propositional Dynamic Logic.Vít Punčochář & Igor Sedlár - 2021 - Journal of Logic, Language and Information 30 (1):91-116.
    This paper combines propositional dynamic logic ) with propositional inquisitive logic ). The result of this combination is a logical system \ that conservatively extends both \ and \, and, moreover, allows for an interaction of the question-forming operator from \ with the structured modalities from \. We study this system from a semantic as well as a syntactic point of view. These two perspectives are linked via a completeness proof, which also shows that \ is decidable.
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • Modal Foundations for Predicate Logic.Johan van Benthem - 1997 - Logic Journal of the IGPL 5 (2):259-286.
    The complexity of any logical modeling reflects both the intrinsic structure of a topic described and the weight of the formal tools. Some of this weight seems inherent in even the most basic logical systems. Notably, standard predicate logic is undecidable. In this paper, we investigate ‘lighter’ versions of this general purpose tool, by modally ‘deconstructing’ the usual semantics, and locating implicit choice points in its set up. The first part sets out the interest of this program and the modal (...)
    Download  
     
    Export citation  
     
    Bookmark   14 citations  
  • Constructive modal logics I.Duminda Wijesekera - 1990 - Annals of Pure and Applied Logic 50 (3):271-301.
    We often have to draw conclusions about states of machines in computer science and about states of knowledge and belief in artificial intelligence based on partial information. Nerode suggested using constructive logic as the language to express such deductions and also suggested designing appropriate intuitionistic Kripke frames to express the partial information. Following this program, Nerode and Wijesekera developed syntax, semantics and completeness for a system of intuitionistic dynamic logic for proving properties of concurrent programs. Like all dynamics logics, this (...)
    Download  
     
    Export citation  
     
    Bookmark   8 citations  
  • Logika a logiky.Jaroslav Peregrin - manuscript
    Kniha, jako je tato, nemůže být tak docela dílem jediného člověka. Dovést ji do podoby koherentního celku bych nedokázal bez pomoci svých kolegů, kteří po mně text četli a upozornili mě na spoustu chyb a nedůsledností, které se v něm vyskytovaly. Můj dík v tomto směru patří zejména Vojtěchu Kolmanovi, Liboru Běhounkovi a Martě Bílkové. Za připomínky k různým částem rukopisu jsem vděčen i Pavlu Maternovi, Milanu Matouškovi, Prokopu Sousedíkovi, Vladimíru Svobodovi, Petru Hájkovi a Grahamu Priestovi. Kniha vznikla v rámci (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • Anaphora and the logic of change.Reinhard Muskens - 1991 - In Talking about Trees and Truth-Conditions. Springer Verlag. pp. 412-427.
    This paper shows how the dynamic interpretation of natural language introduced in work by Hans Kamp and Irene Heim can be modeled in classical type logic. This provides a synthesis between Richard Montague's theory of natural language semantics and the work by Kamp and Heim.
    Download  
     
    Export citation  
     
    Bookmark   12 citations  
  • Reasoning about information change.Jelle Gerbrandy & Willem Groeneveld - 1997 - Journal of Logic, Language and Information 6 (2):147-169.
    In this paper we introduce Dynamic Epistemic Logic, which is alogic for reasoning about information change in a multi-agent system. Theinformation structures we use are based on non-well-founded sets, and canbe conceived as bisimulation classes of Kripke models. On these structures,we define a notion of information change that is inspired by UpdateSemantics (Veltman, 1996). We give a sound and complete axiomatization ofthe resulting logic, and we discuss applications to the puzzle of the dirtychildren, and to knowledge programs.
    Download  
     
    Export citation  
     
    Bookmark   104 citations  
  • Zooming in, zooming out.Patrick Blackburn & Maarten De Rijke - 1997 - Journal of Logic, Language and Information 6 (1):5-31.
    This is an exploratory paper about combining logics, combining theories and combining structures. Typically when one applies logic to such areas as computer science, artificial intelligence or linguistics, one encounters hybrid ontologies. The aim of this paper is to identify plausible strategies for coping with ontological richness.
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  • Krister Segerberg on Logic of Actions.Robert Trypuz (ed.) - 2013 - Dordrecht, Netherland: Springer Verlag.
    Belief revision from the point of view of doxastic logic. Logic Journal of the IGPL, 3(4), 535–553. Segerberg, K. (1995). Conditional action. In G. Crocco, L. Fariñas, & A. Herzig (Eds.), Conditionals: From philosophy to computer science, Studies ...
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • The grammar of quantification and the fine structure of interpretation contexts.Adrian Brasoveanu - 2013 - Synthese 190 (15):3001-3051.
    Providing a compositional interpretation procedure for discourses in which descriptions of complex dependencies between interrelated objects are incrementally built is a key challenge for formal theories of natural language interpretation. This paper examines several quantificational phenomena and argues that to account for these phenomena, we need richly structured contexts of interpretation that are passed on between different parts of the same sentence and also across sentential boundaries. The main contribution of the paper is showing how we can add structure to (...)
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • DEL-sequents for progression.Guillaume Aucher - 2011 - Journal of Applied Non-Classical Logics 21 (3-4):289-321.
    Dynamic Epistemic Logic (DEL) deals with the representation and the study in a multi-agent setting of knowledge and belief change. It can express in a uniform way epistemic statements about: 1. what is true about an initial situation 2. what is true about an event occurring in this situation 3. what is true about the resulting situation after the event has occurred. We axiomatize within the DEL framework what we can infer about (iii) given (i) and (ii). Given three formulas (...)
    Download  
     
    Export citation  
     
    Bookmark   7 citations  
  • Fine-grained Concurrency with Separation Logic.Kalpesh Kapoor, Kamal Lodaya & Uday S. Reddy - 2011 - Journal of Philosophical Logic 40 (5):583-632.
    Reasoning about concurrent programs involves representing the information that concurrent processes manipulate disjoint portions of memory. In sophisticated applications, the division of memory between processes is not static. Through operations, processes can exchange the implied ownership of memory cells. In addition, processes can also share ownership of cells in a controlled fashion as long as they perform operations that do not interfere, e.g., they can concurrently read shared cells. Thus the traditional paradigm of distributed computing based on locations is replaced (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • Computation paths logic: An expressive, yet elementary, process logic.David Harel & Eli Singerman - 1999 - Annals of Pure and Applied Logic 96 (1-3):167-186.
    Download  
     
    Export citation  
     
    Bookmark  
  • Tableaux for constructive concurrent dynamic logic.Duminda Wijesekera & Anil Nerode - 2005 - Annals of Pure and Applied Logic 135 (1-3):1-72.
    This is the first paper on constructive concurrent dynamic logic . For the first time, either for concurrent or sequential dynamic logic, we give a satisfactory treatment of what statements are forced to be true by partial information about the underlying computer. Dynamic logic was developed by Pratt [V. Pratt, Semantical considerations on Floyd–Hoare logic, in: 17th Annual IEEE Symp. on Found. Comp. Sci., New York, 1976, pp. 109–121, V. Pratt, Applications of modal logic to programming, Studia Logica 39 257–274] (...)
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • Information, Interaction, and Agency.Wiebe van der Hoek (ed.) - 2005 - Dordrecht, Netherland: Springer.
    Contemporary epistemological and cognitive studies, as well as recent trends in computer science and game theory have revealed an increasingly important and intimate relationship between Information, Interaction, and Agency. Agents perform actions based on the available information and in the presence of other interacting agents. From this perspective Information, Interaction, and Agency neatly ties together classical themes like rationality, decision-making and belief revision with games, strategies and learning in a multi-agent setting. Unified by the central notions Information, Interaction, and Agency, (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • A logic of situated resource-bounded agents.Natasha Alechina & Brian Logan - 2009 - Journal of Logic, Language and Information 18 (1):79-95.
    We propose a framework for modelling situated resource-bounded agents. The framework is based on an objective ascription of intentional modalities and can be easily tailored to the system we want to model and the properties we wish to specify. As an elaboration of the framework, we introduce a logic, OBA, for describing the observations, beliefs, goals and actions of simple agents, and show that OBA is complete, decidable and has an efficient model checking procedure, allowing properties of agents specified in (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • An Epistemic Approach to Nondeterminism: Believing in the Simplest Course of Events.James P. Delgrande & Hector J. Levesque - 2019 - Studia Logica 107 (5):859-886.
    This paper describes an approach for reasoning in a dynamic domain with nondeterministic actions in which an agent’s beliefs correspond to the simplest, or most plausible, course of events consistent with the agent’s observations and beliefs. The account is based on an epistemic extension of the situation calculus, a first-order theory of reasoning about action that accommodates sensing actions. In particular, the account is based on a qualitative theory of nondeterminism. Our position is that for commonsense reasoning, the world is (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • Algorithmic Iteration for Computational Intelligence.Giuseppe Primiero - 2017 - Minds and Machines 27 (3):521-543.
    Machine awareness is a disputed research topic, in some circles considered a crucial step in realising Artificial General Intelligence. Understanding what that is, under which conditions such feature could arise and how it can be controlled is still a matter of speculation. A more concrete object of theoretical analysis is algorithmic iteration for computational intelligence, intended as the theoretical and practical ability of algorithms to design other algorithms for actions aimed at solving well-specified tasks. We know this ability is already (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • Making a Start with the stit Logic Analysis of Intentional Action.Jan M. Broersen - 2011 - Journal of Philosophical Logic 40 (4):499-530.
    This paper studies intentional action in stit logic. The formal logic study of intentional action appears to be new, since most logical studies of intention concern intention as a static mental state. In the formalization we distinguish three modes of acting: the objective level concerning the choices an agent objectively exercises, the subjective level concerning the choices an agent knows or believes to be exercising, and finally, the intentional level concerning the choices an agent intentionally exercises. Several axioms constraining the (...)
    Download  
     
    Export citation  
     
    Bookmark   11 citations  
  • Towards an exact philosophy of action.Krister Segerberg - 1984 - Topoi 3 (1):75-83.
    Download  
     
    Export citation  
     
    Bookmark   11 citations