Results for 'cost-based abduction, first-order predicate logic, A * search, real-time A * search, multi-agent search'

962 found
Order:
  1.  23
    仮説推論に対する3種の近似解法.岡峰 正 越野 亮 - 2001 - Transactions of the Japanese Society for Artificial Intelligence 16:465-472.
    Cost-based abduction, which is a technique for identifying the best explanation for a given observation based on the assumption of a set of hypothesis, is a useful knowledge processing framework for practical problems such as diagnosis, design and planning. However, the speed of reasoning of this approach is often slow. To overcome this problem, Kato et al. previously presented a more efficient cost-based abduction system, that utilized the A * search technique, however, the (...) and space complexities in this technique are exponential, so the identification of the optimal solution is difficult in practical applications. In this paper, we present three new systems in which the user can define the computational complexity, for identification of a near-optimal solution. First, we introduce two search control techniques; a real-time A * search approach in which the user can define the look-ahead depth or space, and the multi-agent real-time A * approach in which the user can define the number of real-time A * agents used in the search. We describe the implementation of three cost-based abduction reasoning systems for predicate logic knowledge bases and test the proposed systems using a diagnostic logic circuit problem. The results show that proposed systems can identify a near-optimal solution according to the predefined polynomial order of complexity, including the selection of either linear or exponential computational complexity. It is also shown that inference time and success rate are dependent on the user-defined parameters, that the three proposed systems exhibit similar performance characteristics, and that they all offer significant speed advantages over the previously described technique. (shrink)
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  2.  22
    Periodicity Based Decidable Classes in a First Order Timed Logic.Danièle Beauquier & Anatol Slissenko - 2006 - Annals of Pure and Applied Logic 139 (1):43-73.
    We describe a decidable class of formulas in a first order timed logic that covers a good amount of properties of real-time distributed systems. Earlier we described a decidable class based on some finiteness properties, and sketched a decidable class in a weaker logic that captures periodicity properties, though without complete proof. The new feature of the decidable class presented here is to be able to treat parametric properties, in particular, properties that concern an arbitrary (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  3.  37
    Large-Scale cost-based abduction in full-fledged first-order predicate logic with cutting plane inference.Naoya Inoue & Kentaro Inui - 2012 - In Luis Farinas del Cerro, Andreas Herzig & Jerome Mengin (eds.), Logics in Artificial Intelligence. Springer. pp. 281--293.
  4.  15
    Multi-agent reinforcement learning based algorithm detection of malware-infected nodes in IoT networks.Marcos Severt, Roberto Casado-Vara, Ángel Martín del Rey, Héctor Quintián & Jose Luis Calvo-Rolle - forthcoming - Logic Journal of the IGPL.
    The Internet of Things (IoT) is a fast-growing technology that connects everyday devices to the Internet, enabling wireless, low-consumption and low-cost communication and data exchange. IoT has revolutionized the way devices interact with each other and the internet. The more devices become connected, the greater the risk of security breaches. There is currently a need for new approaches to algorithms that can detect malware regardless of the size of the network and that can adapt to dynamic changes in the (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  5. Changing for the Better: Preference Dynamics and Agent Diversity.Fenrong Liu - 2008 - Dissertation, University of Amsterdam
    This thesis investigates two main issues concerning the behavior of rational agents, preference dynamics and agent diversity. -/- We take up two questions left aside by von Wright, and later also the multitude of his successors, in his seminal book Logic of Preference in 1963: reasons for preference, and changes in preference. Various notions of preference are discussed, compared and further correlated in the thesis. In particular, we concentrate on extrinsic preference. Contrary to intrinsic preference, extrinsic preference is reason- (...), i.e. one's preference for one option over another has a reason. A logical model is proposed and its properties are determined. Dynamics come in naturally, since reasons for the preferences can change. Logical systems and formal results regarding dynamical preference change are then presented. -/- Preference arises from comparisons between alternatives. A first option is to compare situations. Abstractly speaking, preferences are in this case between propositions, viewed as sets of possible worlds. The reasons can then be based on a `betterness' relation over possible worlds. Propositional preference arises as a lift from this primitive relation. A standard modal logical approach is taken and we use a modality for the betterness relation in the language. We then model preference change by techniques from dynamic epistemic logic (DEL), where a typical action, e.g. a suggestion or a command can change the betterness ordering of the worlds, and thereby the propositional preference. Dynamic reduction axioms are obtained to encode exactly how such a change takes place. We obtain a complete dynamic preference logic. -/- A second option is to compare objects as such. Concretely, properties of the objects often determine the preference over the objects. Properties are now the reasons. Inspired by Optimality Theory (OT), we propose a priority sequence, an ordering of properties. Various ways of getting a preference from the priority sequence are investigated, though we mostly follow the OT approach. We use a fragment of first-order logic to describe the situation. Here, on the dynamic side, it is priority change that leads to preference change. Using the DEL methodology again we propose a complete set of reduction axioms concerning the possible dynamic operations on priority sequences. -/- Not surprisingly, the above two views are closely related. After all, possible worlds can be thought of as objects! On the basis of a systematic comparison of the two views, we develop a two level perspective, in which the models themselves are structured in layers. In particular, correspondence results between the changes at the level of the possible worlds and the changes at the level of the priority sequences are proved. We end up by sketching a two-level preferential predicate logic to describe more complex circumstances in which situations and objects are compared simultaneously. -/- But we do not see this as the whole story. Preference does not live by itself, it is often intermingled with epistemic notions of knowledge and belief. One can have different intuitions about how this entanglement operates. A few options are discussed, and proposals for logical models are presented. When moving to dynamics, we now see a picture of knowledge update, belief revision and preference change taking place symbiotically, often unconsciously as in real life. -/- The resulting picture in the thesis is one of agents that process information and adjust beliefs and preferences in many different ways. There is no logically prescribed unique norm for doing this. The second part of the thesis takes this general phenomenon of diversity of agents as its focus, since it raises many issues for logical systems and the idealized agents which they normally presuppose. In reality, agents can differ across a wide spectrum of cognitive abilities and habits: in their memory capacity, observation power, inferential power, introspective ability, and revision policies when facing new information. -/- Two kinds of agents, perfect recall agents, and memory-free agents are studied thoroughly, in the setting of playing games. We show how current dynamic logics can be `parametrized' to allow for this memory diversity, with new characterizations of agent types resulting in complete dynamic-epistemic logics. The other dimension of the reality of diverse agents is that, however different they are, they often do manage to coordinate with each other successfully. While this theme has been prominent in game theory and multi-agent systems, it has received hardly any attention in logic. We analyze this interaction between different agents by looking at concrete scenarios which model their types explicitly. -/- Finally, we analyze the issue of agent diversity in its generality, discussing what dynamic logics would have to look like to become a full-fledged account of agents of different capacities and tendencies that pursue and sometimes achieve their goals in irreducibly social settings. -/- . (shrink)
    No categories
     
    Export citation  
     
    Bookmark   17 citations  
  6.  33
    First-order t-norm based fuzzy logics with truth-constants: distinguished semantics and completeness properties.Francesc Esteva, Lluís Godo & Carles Noguera - 2010 - Annals of Pure and Applied Logic 161 (2):185-202.
    This paper aims at being a systematic investigation of different completeness properties of first-order predicate logics with truth-constants based on a large class of left-continuous t-norms . We consider standard semantics over the real unit interval but also we explore alternative semantics based on the rational unit interval and on finite chains. We prove that expansions with truth-constants are conservative and we study their real, rational and finite chain completeness properties. Particularly interesting is (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  7. Formulating Avicenna's Argument of Truthful Ones in the Book of Nejat Based on the First-Order Predicate Logic.Homa Ranjbar, Davood Hosseini & Mohammad Saeedimehr - 2013 - Avicennian Philosophy Journal 17 (50):17-40.
    According to a common definition, the argument of truthful ones is an argument in which the existence of Necessary Being is proved with no presumption of the existence of the possible being. Avicenna proposed different versions of this style of argument and the version in the book of Nejat is one of them. This paper is intended to examine the possibility of proving the logical validity of this version in first-order predicate logic and explain the principles which (...)
    No categories
     
    Export citation  
     
    Bookmark  
  8.  21
    A first order logic for specification of timed algorithms: basic properties and a decidable class.Danièle Beauquier & Anatol Slissenko - 2001 - Annals of Pure and Applied Logic 113 (1-3):13-52.
    We consider one aspect of the problem of specification and verification of reactive real-time systems which involve operations and constraints concerning time. Time is continuous what is motivated by specifications of hybrid systems. Our goal is to try to find a framework that is based on applied first order logic that permits to represent the verification problem directly, completely and conservatively , and that is apt to describe interesting decidable classes, maybe showing way (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  9.  53
    Story (first order predicate) logic.Göran Rossholm - 2007 - Semiotica 2007 (165):149-172.
    This article is an attempt to clarify the idea that narratives cohere by representing stories. Stories are causally related in the way proposed by Noël Carroll, i.e., the events and states constitute necessary conditions or sufficient conditions or INUS-conditions of each other. Then, a general concept of propositional coherence is suggested. It is based on Nelson Goodman's and Joseph Ullian's ideas about unitary formulas. Narrative coherence is defined as the propositional understanding of a text (in the wide sense, including (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  10.  39
    Proof Theory of First Order Abduction: Sequent Calculus and Structural Rules.Seyed Ahmad Mirsanei - 2021 - Eighth Annual Conference of Iranian Association for Logic (Ial).
    The logical formalism of abductive reasoning is still an open discussion and various theories have been presented about it. Abduction is a type of non-monotonic and defeasible reasonings, and the logic containing such a reasoning is one of the types of non-nonmonotonic and defeasible logics, such as inductive logic. Abduction is a kind of natural reasoning and it is a solution to the problems having this form "the phenomenon of φ cannot be explained by the theory of Θ" and we (...)
    Direct download  
     
    Export citation  
     
    Bookmark  
  11.  19
    述語論理知識を扱う全解探索仮説推論の高速化.林 貴宏 越野 亮 - 2001 - Transactions of the Japanese Society for Artificial Intelligence 16:202-211.
    A hypothetical reasoning, which can find an explanation for a given set of observation by assuming some hypothetical sets, is a useful knowledge processing framework because of its theoretical basis and usefulness for practical problems such as diagnostics, scheduling, and design. It is, however, known to be computationally very expensive for large problems because it must deal with incomplete knowledge. Predicate-logic allows powerful and compact knowledge representation compared to propositional-logic. Efficient methods to proceed reasoning have been developed for propositional-logic. (...)
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  12.  80
    A general approach to multi-agent minimal knowledge: With tools and Samples.Wiebe van der Hoek & Elias Thijsse - 2002 - Studia Logica 72 (1):61-84.
    We extend our general approach to characterizing information to multi-agent systems. In particular, we provide a formal description of an agent''s knowledge containing exactly the information conveyed by some (honest) formula . Only knowing is important for dynamic agent systems in two ways. First of all, one wants to compare different states of knowledge of an agent and, secondly, for agent a''s decisions, it may be relevant that (he knows that) agent b (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  13. (1 other version)A first-order policy language for history-based transaction monitoring.Andreas Bauer - unknown
    Online trading invariably involves dealings between strangers, so it is important for one party to be able to judge objectively the trustworthiness of the other. In such a setting, the decision to trust a user may sensibly be based on that user’s past behaviour. We introduce a specification language based on linear temporal logic for expressing a policy for categorising the behaviour patterns of a user depending on its transaction history. We also present an algorithm for checking whether (...)
    No categories
     
    Export citation  
     
    Bookmark  
  14.  62
    From human regulations to regulated software agents’ behavior: Connecting the abstract declarative norms with the concrete operational implementation. A position paper.Javier Vázquez-Salceda, Huib Aldewereld, Davide Grossi & Frank Dignum - 2008 - Artificial Intelligence and Law 16 (1):73-87.
    In order to design and implement electronic institutions that incorporate norms governing the behavior of the participants of those institutions, some crucial steps should be taken. The first problem is that human norms are (on purpose) specified on an abstract level. This ensures applicability of the norms over long periods of time in many different circumstances. However, for an electronic institution to function according to those norms, they should be concrete enough to be able to check them (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  15.  95
    Many-dimensional modal logics: theory and applications.Dov M. Gabbay (ed.) - 2003 - Boston: Elsevier North Holland.
    Modal logics, originally conceived in philosophy, have recently found many applications in computer science, artificial intelligence, the foundations of mathematics, linguistics and other disciplines. Celebrated for their good computational behaviour, modal logics are used as effective formalisms for talking about time, space, knowledge, beliefs, actions, obligations, provability, etc. However, the nice computational properties can drastically change if we combine some of these formalisms into a many-dimensional system, say, to reason about knowledge bases developing in time or moving objects. (...)
    Direct download  
     
    Export citation  
     
    Bookmark   49 citations  
  16.  11
    Strong Completeness of a First-Order Temporal Logic for Real Time.Robert Goldblatt - forthcoming - Review of Symbolic Logic:1-18.
    Propositional temporal logic over the real number time flow is finitely axiomatisable, but its first-order counterpart is not recursively axiomatisable. We study the logic that combines the propositional axiomatisation with the usual axioms for first-order logic with identity, and develop an alternative “admissible” semantics for it, showing that it is strongly complete for admissible models over the reals. By contrast there is no recursive axiomatisation of the first-order temporal logic of admissible models (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  17. First-order intensional logic.Melvin Fitting - 2004 - Annals of Pure and Applied Logic 127 (1-3):171-193.
    First - order modal logic is very much under current development, with many different semantics proposed. The use of rigid objects goes back to Saul Kripke. More recently, several semantics based on counterparts have been examined, in a development that goes back to David Lewis. There is yet another line of research, using intensional objects, that traces back to Richard Montague. I have been involved with this line of development for some time. In the present paper, (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   28 citations  
  18. A Revolutionary New Metaphysics, Based on Consciousness, and a Call to All Philosophers.Lorna Green - manuscript
    June 2022 A Revolutionary New Metaphysics, Based on Consciousness, and a Call to All Philosophers We are in a unique moment of our history unlike any previous moment ever. Virtually all human economies are based on the destruction of the Earth, and we are now at a place in our history where we can foresee if we continue on as we are, our own extinction. As I write, the planet is in deep trouble, heat, fires, great storms, and (...)
    No categories
    Direct download  
     
    Export citation  
     
    Bookmark  
  19. Cosmic Pessimism.Eugene Thacker - 2012 - Continent 2 (2):66-75.
    continent. 2.2 (2012): 66–75 ~*~ We’re Doomed. Pessimism is the night-side of thought, a melodrama of the futility of the brain, a poetry written in the graveyard of philosophy. Pessimism is a lyrical failure of philosophical thinking, each attempt at clear and coherent thought, sullen and submerged in the hidden joy of its own futility. The closest pessimism comes to philosophical argument is the droll and laconic “We’ll never make it,” or simply: “We’re doomed.” Every effort doomed to failure, every (...)
     
    Export citation  
     
    Bookmark   4 citations  
  20.  55
    Hermann Dishkant. The first order predicate calculus based on the logic of quantum mechanics. Reports on mathematical logic, no. 3 , pp. 9–17. - G. N. Georgacarakos. Orthomodularity and relevance. Journal of philosophical logic, vol. 8 , pp. 415–432. - G. N. Georgacarakos. Equationally definable implication algebras for orthomodular lattices. Studia logica, vol. 39 , pp. 5–18. - R. J. Greechie and S. P. Gudder. Is a quantum logic a logic?Helvetica physica acta, vol. 44 , pp. 238–240. - Gary M. Hardegree. The conditional in abstract and concrete quantum logic. The logico-algehraic approach to quantum mechanics, volume II, Contemporary consolidation, edited by C. A. Hooker, The University of Western Ontario series in philosophy of science, vol. 5, D. Reidel Publishing Company, Dordrecht, Boston, and London, 1979, pp. 49–108. - Gary M. Hardegree. Material implication in orthomodular lattices. Notre Dame journal of formal logic, vol. 22 , pp. 163–182. - J. M. Jauch and C. Piron. What is “q. [REVIEW]Alasdair Urquhart - 1983 - Journal of Symbolic Logic 48 (1):206-208.
  21.  21
    The suppression task and firstorder predicate calculus.Miguel López-Astorga - 2023 - Theoria 89 (6):800-810.
    The suppression task challenges classical logic. Classical logic is monotonic. However, in the suppression task, an inference with the form of modus ponendo ponens is inhibited by adding a new premise. Several explanations have been given to account for this fact. The present paper indicates three of them as examples: that of the theory of mental models, that based on logic programming and closed world assumption, and that referring to Carnap's concept of state‐descriptions. Besides, the paper offers one more (...)
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  22.  81
    First-order fuzzy logic.Vilém Novák - 1987 - Studia Logica 46 (1):87 - 109.
    This paper is an attempt to develop the many-valued first-order fuzzy logic. The set of its truth, values is supposed to be either a finite chain or the interval 0, 1 of reals. These are special cases of a residuated lattice L, , , , , 1, 0. It has been previously proved that the fuzzy propositional logic based on the same sets of truth values is semantically complete. In this paper the syntax and semantics of the (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   5 citations  
  23. Roles, Rigidity and Quantification in Epistemic Logic.Wesley H. Holliday & John Perry - 2014 - In Alexandru Baltag & Sonja Smets (eds.), Johan van Benthem on Logic and Information Dynamics. Cham, Switzerland: Springer International Publishing. pp. 591-629.
    Epistemic modal predicate logic raises conceptual problems not faced in the case of alethic modal predicate logic : Frege’s “Hesperus-Phosphorus” problem—how to make sense of ascribing to agents ignorance of necessarily true identity statements—and the related “Hintikka-Kripke” problem—how to set up a logical system combining epistemic and alethic modalities, as well as others problems, such as Quine’s “Double Vision” problem and problems of self-knowledge. In this paper, we lay out a philosophical approach to epistemic predicate logic, implemented (...)
    Direct download  
     
    Export citation  
     
    Bookmark   12 citations  
  24.  56
    A Sat-Based Approach to Unbounded Model Checking for Alternating-Time Temporal Epistemic Logic.M. Kacprzak & W. Penczek - 2004 - Synthese 142 (2):203-227.
    This paper deals with the problem of verification of game-like structures by means of symbolic model checking. Alternating-time Temporal Epistemic Logic (ATEL) is used for expressing properties of multi-agent systems represented by alternating epistemic temporal systems as well as concurrent epistemic game structures. Unbounded model checking (a SAT based technique) is applied for the first time to verification of ATEL. An example is given to show an application of the technique.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  25. On Universally Free First-Order Extensions of Belnap-Dunn’s Four-Valued Logic and Nelson’s Paraconsistent Logic $$N{4}$$.Henrique Antunes & Abilio Rodrigues - forthcoming - Journal of Philosophical Logic:1-27.
    The aim of this paper is to introduce the logics $$\textit{FFDE}$$ and $$\textit{FN}{4}$$, which are universally free versions of Belnap-Dunn’s four-valued logic, also known as the logic of first-degree entailment ( $$\textit{FDE}$$ ), and Nelson’s paraconsistent logic $$N^{-}$$ (a.k.a. $$Q\!N {4}$$ ). Both $$\textit{FDE}$$ and $$Q\!N {4}$$ are suitable to be interpreted as information-based logics, that is, logics that are capable of representing the deductive behavior of possibly inconsistent and incomplete information in a database. Like $$Q\!N {4}$$ and (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  26. Preference-based belief revision for rule-based agents.Natasha Alechina, Mark Jago & Brian Logan - 2008 - Synthese 165 (2):159-177.
    Agents which perform inferences on the basis of unreliable information need an ability to revise their beliefs if they discover an inconsistency. Such a belief revision algorithm ideally should be rational, should respect any preference ordering over the agent’s beliefs (removing less preferred beliefs where possible) and should be fast. However, while standard approaches to rational belief revision for classical reasoners allow preferences to be taken into account, they typically have quite high complexity. In this paper, we consider belief (...)
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark  
  27.  73
    A neural cognitive model of argumentation with application to legal inference and decision making.Artur S. D'Avila Garcez, Dov M. Gabbay & Luis C. Lamb - 2014 - Journal of Applied Logic 12 (2):109-127.
    Formal models of argumentation have been investigated in several areas, from multi-agent systems and artificial intelligence (AI) to decision making, philosophy and law. In artificial intelligence, logic-based models have been the standard for the representation of argumentative reasoning. More recently, the standard logic-based models have been shown equivalent to standard connectionist models. This has created a new line of research where (i) neural networks can be used as a parallel computational model for argumentation and (ii) neural (...)
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  28.  20
    Towards Abductive Reasoning in First-order Logic.A. Reyes-Cabello, Atocha Aliseda-Llera & Ángel Nepomuceno-fernández - 2006 - Logic Journal of the IGPL 14 (2):287-394.
    Abductive problems have been widely studied in propositional logic. First order abduction, however, has been viewed as intractable, for the undecidability of logical consequence. In this paper, we propose a notion of abductive problem, N-abductive problem, which is relative to the cardinality of the minimal model satisfying the given theory. We use a notion of restricted satisfaction, also relative to a domain cardinality. Finally, we propose an effective procedure for the searching of abductive solutions, by means of a (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   6 citations  
  29.  42
    A complete axiom system for polygonal mereotopology of the real plane.Ian Pratt & Dominik Schoop - 1998 - Journal of Philosophical Logic 27 (6):621-658.
    This paper presents a calculus for mereotopological reasoning in which two-dimensional spatial regions are treated as primitive entities. A first order predicate language ℒ with a distinguished unary predicate c(x), function-symbols +, · and - and constants 0 and 1 is defined. An interpretation ℜ for ℒ is provided in which polygonal open subsets of the real plane serve as elements of the domain. Under this interpretation the predicate c(x) is read as 'region x (...)
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   16 citations  
  30. Strategic commitment and release in logics for multi-agent systems.Thomas Ågotnes, Valentin Goranko & Wojciech Jamroga - manuscript
    In this paper we analyze how the semantics of the Alternating-time Temporal Logic ATL$^*$ deals with agents' commitments to strategies in the process of formula evaluation. In (\acro{atl}$^*$), one can express statements about the strategic ability of an agent (or a coalition of agents) to achieve a goal $\phi$ such as: ``agent $i$ can choose a strategy such that, if $i$ follows this strategy then, no matter what other agents do, $\phi$ will always be true''. However, strategies (...)
    Direct download  
     
    Export citation  
     
    Bookmark   1 citation  
  31. Propositional Epistemic Logics with Quantification Over Agents of Knowledge.Gennady Shtakser - 2018 - Studia Logica 106 (2):311-344.
    The paper presents a family of propositional epistemic logics such that languages of these logics are extended by quantification over modal operators or over agents of knowledge and extended by predicate symbols that take modal operators as arguments. Denote this family by \}\). There exist epistemic logics whose languages have the above mentioned properties :311–350, 1995; Lomuscio and Colombetti in Proceedings of ATAL 1996. Lecture Notes in Computer Science, vol 1193, pp 71–85, 1996). But these logics are obtained from (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  32. W poszukiwaniu ontologicznych podstaw prawa. Arthura Kaufmanna teoria sprawiedliwości [In Search for Ontological Foundations of Law: Arthur Kaufmann’s Theory of Justice].Marek Piechowiak - 1992 - Instytut Nauk Prawnych PAN.
    Arthur Kaufmann is one of the most prominent figures among the contemporary philosophers of law in German speaking countries. For many years he was a director of the Institute of Philosophy of Law and Computer Sciences for Law at the University in Munich. Presently, he is a retired professor of this university. Rare in the contemporary legal thought, Arthur Kaufmann's philosophy of law is one with the highest ambitions — it aspires to pinpoint the ultimate foundations of law by explicitly (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  33.  61
    On the maximality of logics with approximations.José Iovino - 2001 - Journal of Symbolic Logic 66 (4):1909-1918.
    In this paper we analyze some aspects of the question of using methods from model theory to study structures of functional analysis.By a well known result of P. Lindström, one cannot extend the expressive power of first order logic and yet preserve its most outstanding model theoretic characteristics (e.g., compactness and the Löwenheim-Skolem theorem). However, one may consider extending the scope of first order in a different sense, specifically, by expanding the class of structures that are (...)
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark   5 citations  
  34.  41
    A Logic for Multiple-source Approximation Systems with Distributed Knowledge Base.Md Aquil Khan & Mohua Banerjee - 2011 - Journal of Philosophical Logic 40 (5):663-692.
    The theory of rough sets starts with the notion of an approximation space , which is a pair ( U , R ), U being the domain of discourse, and R an equivalence relation on U . R is taken to represent the knowledge base of an agent, and the induced partition reflects a granularity of U that is the result of a lack of complete information about the objects in U . The focus then is on approximations of (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark  
  35.  26
    An Event-Based Fragment of First-Order Logic over Intervals.Savas Konur - 2011 - Journal of Logic, Language and Information 20 (1):49-68.
    We consider a new fragment of first-order logic with two variables. This logic is defined over interval structures. It constitutes unary predicates, a binary predicate and a function symbol. Considering such a fragment of first-order logic is motivated by defining a general framework for event-based interval temporal logics. In this paper, we present a sound, complete and terminating decision procedure for this logic. We show that the logic is decidable, and provide a NEXPTIME complexity (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  36.  28
    A short introduction to intuitionistic logic.Grigori Mints - 2000 - New York: Kluwer Academic / Plenum Publishers.
    Intuitionistic logic is presented here as part of familiar classical logic which allows mechanical extraction of programs from proofs. to make the material more accessible, basic techniques are presented first for propositional logic; Part II contains extensions to predicate logic. This material provides an introduction and a safe background for reading research literature in logic and computer science as well as advanced monographs. Readers are assumed to be familiar with basic notions of first order logic. One (...)
    Direct download  
     
    Export citation  
     
    Bookmark   11 citations  
  37.  41
    Multi-agent Logics for Reasoning About Higher-Order Upper and Lower Probabilities.Dragan Doder, Nenad Savić & Zoran Ognjanović - 2020 - Journal of Logic, Language and Information 29 (1):77-107.
    We present a propositional and a first-order logic for reasoning about higher-order upper and lower probabilities. We provide sound and complete axiomatizations for the logics and we prove decidability in the propositional case. Furthermore, we show that the introduced logics generalize some existing probability logics.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  38.  42
    A New Period of the Mutual Rapprochement of the Western and Chinese Civilizations: Towards a Common Appreciation of Harmony and Co-operation.Krzysztof Gawlikowski - 2011 - Dialogue and Universalism 21 (2):115-162.
    Since the 1990’s the rise of China provokes heated debates in the West. Numerous politicians and scholars, who study contemporary political affairs, pose the question, which will be the new role of China in international affairs? Many Western observers presume that China will act as the Western powers did in the past, promoting policy of domination, enslavement and gaining profits at all costs. The Chinese declarations on peace, co-operation, mutual interests, and harmony are often considered empty words, a certain decorum (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  39.  46
    A sense-based, process model of belief.Robert F. Hadley - 1991 - Minds and Machines 1 (3):279-320.
    A process-oriented model of belief is presented which permits the representation of nested propositional attitudes within first-order logic. The model (NIM, for nested intensional model) is axiomatized, sense-based (via intensions), and sanctions inferences involving nested epistemic attitudes, with different agents and different times. Because NIM is grounded upon senses, it provides a framework in which agents may reason about the beliefs of another agent while remaining neutral with respect to the syntactic forms used to express the (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  40. Incompleteness of a first-order Gödel logic and some temporal logics of programs.Matthias Baaz, Alexander Leitsch & Richard Zach - 1996 - In Kleine Büning Hans (ed.), Computer Science Logic. CSL 1995. Selected Papers. Springer. pp. 1--15.
    It is shown that the infinite-valued first-order Gödel logic G° based on the set of truth values {1/k: k ε w {0}} U {0} is not r.e. The logic G° is the same as that obtained from the Kripke semantics for first-order intuitionistic logic with constant domains and where the order structure of the model is linear. From this, the unaxiomatizability of Kröger's temporal logic of programs (even of the fragment without the nexttime operator (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  41.  66
    On A New Semantics for First-Order Predicate Logic.István Németi, Johan van Benthem & Hajnal Andréka - 2017 - Journal of Philosophical Logic 46 (3):259-267.
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  42. A Logic For Inductive Probabilistic Reasoning.Manfred Jaeger - 2005 - Synthese 144 (2):181-248.
    Inductive probabilistic reasoning is understood as the application of inference patterns that use statistical background information to assign (subjective) probabilities to single events. The simplest such inference pattern is direct inference: from “70% of As are Bs” and “a is an A” infer that a is a B with probability 0.7. Direct inference is generalized by Jeffrey’s rule and the principle of cross-entropy minimization. To adequately formalize inductive probabilistic reasoning is an interesting topic for artificial intelligence, as an autonomous system (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  43.  16
    Universal first-order logic is superfluous in the second level of the polynomial-time hierarchy.Nerio Borges & Edwin Pin - 2019 - Logic Journal of the IGPL 27 (6):895-909.
    In this paper we prove that $\forall \textrm{FO}$, the universal fragment of first-order logic, is superfluous in $\varSigma _2^p$ and $\varPi _2^p$. As an example, we show that this yields a syntactic proof of the $\varSigma _2^p$-completeness of value-cost satisfiability. The superfluity method is interesting since it gives a way to prove completeness of problems involving numerical data such as lengths, weights and costs and it also adds to the programme started by Immerman and Medina about the (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  44.  21
    A modified biogeography-based optimization algorithm with improved mutation operator for job shop scheduling problem with time lags.Madiha Harrabi, Olfa Belkahla Driss & Khaled Ghedira - forthcoming - Logic Journal of the IGPL.
    This paper addresses the job shop scheduling problem including time lag constraints. This is an extension of the job shop scheduling problem with many applications in real production environments, where extra delays can be introduced between successive operations of the same job. It belongs to a category of problems known as NP-hard problem due to large solution space. Biogeography-based optimization is an evolutionary algorithm which is inspired by the migration of species between habitats, recently proposed by Simon (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  45.  32
    On A New Semantics for First-Order Predicate Logic.István Németi, Johan Benthem & Hajnal Andréka - 2017 - Journal of Philosophical Logic 46 (3):259-267.
    Direct download  
     
    Export citation  
     
    Bookmark   1 citation  
  46.  23
    Semantical Completeness of First-Order Predicate Logic and the Weak Fan Theorem.Victor N. Krivtsov - 2015 - Studia Logica 103 (3):623-638.
    Within a weak system \ of intuitionistic analysis one may prove, using the Weak Fan Theorem as an additional axiom, a completeness theorem for intuitionistic first-order predicate logic relative to validity in generalized Beth models as well as a completeness theorem for classical first-order predicate logic relative to validity in intuitionistic structures. Conversely, each of these theorems implies over \ the Weak Fan Theorem.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  47. Two-valued logics of intentionality: Temporality, truth, modality, and identity.Gilbert T. Null - 2007 - Husserl Studies 23 (3):187-228.
    The essay introduces a non-Diodorean, non-Kantian temporal modal semantics based on part-whole, rather than class, theory. Formalizing Edmund Husserl’s theory of inner time consciousness, §3 uses his protention and retention concepts to define a relation of self-awareness on intentional events. §4 introduces a syntax and two-valued semantics for modal first-order predicate object-languages, defines semantic assignments for variables and predicates, and truth for formulae in terms of the axiomatic version of Edmund Husserl’s dependence ontology (viz. the (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  48.  14
    Person in a Digital Society: Triumph and Tragedy.V. Shapoval - 2023 - Philosophical Horizons 46:50-59.
    Human civilization is moving into the digital age. Many believe that total digitalization is bringing humanity closer to the dream age of general wellbeing and happiness. However, although there is a real revolution in the knowledge and mastering of the world, the tension and conflicts within human society do not stop, and people do not feel happier. This determines the aim and the tasks of the research, which are based on the analysis of deep contradictions and conflicts existing (...)
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  49.  39
    The Epistemological Consequences of Artificial Intelligence, Precision Medicine, and Implantable Brain-Computer Interfaces.Ian Stevens - 2024 - Voices in Bioethics 10.
    ABSTRACT I argue that this examination and appreciation for the shift to abductive reasoning should be extended to the intersection of neuroscience and novel brain-computer interfaces too. This paper highlights the implications of applying abductive reasoning to personalized implantable neurotechnologies. Then, it explores whether abductive reasoning is sufficient to justify insurance coverage for devices absent widespread clinical trials, which are better applied to one-size-fits-all treatments. INTRODUCTION In contrast to the classic model of randomized-control trials, often with a large number of (...)
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  50.  50
    First-order Logics of Evidence and Truth with Constant and Variable Domains.Abilio Rodrigues & Henrique Antunes - 2022 - Logica Universalis 16 (3):419-449.
    The main aim of this paper is to introduce first-order versions of logics of evidence and truth, together with corresponding sound and complete Kripke semantics with variable and constant domains. According to the intuitive interpretation proposed here, these logics intend to represent possibly inconsistent and incomplete information bases over time. The paper also discusses the connections between Belnap-Dunn’s and da Costa’s approaches to paraconsistency, and argues that the logics of evidence and truth combine them in a very (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   2 citations  
1 — 50 / 962