Computer Science › Artificial Intelligence

Logic, Reasoning, and Knowledge

Works Count: 59511

Wikipedia

Description

This cluster of papers focuses on the intersection of logic programming, knowledge representation, and reasoning. It encompasses topics such as answer set programming, modal logic, belief revision, temporal logic, epistemic logic, nonmonotonic reasoning, description logics, model checking, and constraint logic programming.

Keywords

Answer Set Programming; Modal Logic; Knowledge Representation; Belief Revision; Temporal Logic; Epistemic Logic; Nonmonotonic Reasoning; Description Logics; Model Checking; Constraint Logic Programming

A Useful Four-Valued Logic

1977-01-01

Nuel Belnap

Automated Planning: Theory and Practice

2004-01-01

Malik Ghallab , Dana S. Nau , Paolo Traverso

1 Introduction and Overview I Classical Planning 2 Representations for Classical Planning*3 Complexity of Classical Planning*4 State-Space Planning*5 Plan-Space Planning II Neoclassical Planning 6 Planning-Graph Techniques*7 Propositional Satisfiability Techniques*8 Constraint … 1 Introduction and Overview I Classical Planning 2 Representations for Classical Planning*3 Complexity of Classical Planning*4 State-Space Planning*5 Plan-Space Planning II Neoclassical Planning 6 Planning-Graph Techniques*7 Propositional Satisfiability Techniques*8 Constraint Satisfaction Techniques III Heuristics and Control Strategies 9 Heuristics in Planning*10 Control Rules in Planning*11 Hierarchical Task Network Planning*12 Control Strategies in Deductive Planning IV Planning with Time and Resources 13 Time for Planning*14 Temporal Planning*15 Planning and Resource Scheduling V Planning under Uncertainty 16 Planning based on Markov Decision Processes*17 Planning based on Model Checking*18 Uncertainty with Neo-Classical Techniques VI Case Studies and Applications 19 Space Applications*20 Planning in Robotics*21 Planning for Manufacturability Analysis*22 Emergency Evacuation Planning *23 Planning in the Game of Bridge VII Conclusion 24 Conclusion and Other Topics VIII Appendices A Search Procedures and Computational Complexity*B First Order Logic*C Model Checking

Foundations of Logic Programming

1984-01-01

John W. Lloyd

A Theory of Approximate Reasoning

1979-01-01

Lotfi A. Zadeh

Agent theories, architectures, and languages: A survey

1995-01-01

Michael Wooldridge , Nicholas R. Jennings

View PDF Chat

Vagueness, truth and logic

1975-01-01

Kit Fine

The well-founded semantics for general logic programs

1991-07-01

Allen Van Gelder , Kenneth A. Ross , John S. Schlipf

article Free Access Share on The well-founded semantics for general logic programs Authors: Allen Van Gelder Univ. of California at Santa Cruz, Santa Cruz Univ. of California at Santa Cruz, … article Free Access Share on The well-founded semantics for general logic programs Authors: Allen Van Gelder Univ. of California at Santa Cruz, Santa Cruz Univ. of California at Santa Cruz, Santa CruzView Profile , Kenneth A. Ross Sanford Univ., Stanford, CA Sanford Univ., Stanford, CAView Profile , John S. Schlipf Univ. of Cincinnati, Cincinnati, OH Univ. of Cincinnati, Cincinnati, OHView Profile Authors Info & Claims Journal of the ACMVolume 38Issue 3July 1991 pp 619–649https://doi.org/10.1145/116825.116838Published:01 July 1991Publication History 1,049citation2,024DownloadsMetricsTotal Citations1,049Total Downloads2,024Last 12 Months137Last 6 weeks34 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteeReaderPDF

The DLV system for knowledge representation and reasoning

2006-07-01

Nicola Leone , Gerald Pfeifer , Wolfgang Faber +4 more

Disjunctive Logic Programming (DLP) is an advanced formalism for knowledge representation and reasoning, which is very expressive in a precise mathematical sense: it allows one to express every property of … Disjunctive Logic Programming (DLP) is an advanced formalism for knowledge representation and reasoning, which is very expressive in a precise mathematical sense: it allows one to express every property of finite structures that is decidable in the complexity class Σ P 2 (NP NP ). Thus, under widely believed assumptions, DLP is strictly more expressive than normal ( disjunction-free ) logic programming, whose expressiveness is limited to properties decidable in NP. Importantly, apart from enlarging the class of applications which can be encoded in the language, disjunction often allows for representing problems of lower complexity in a simpler and more natural fashion.This article presents the DLV system, which is widely considered the state-of-the-art implementation of disjunctive logic programming, and addresses several aspects. As for problem solving, we provide a formal definition of its kernel language, function-free disjunctive logic programs (also known as disjunctive datalog ), extended by weak constraints, which are a powerful tool to express optimization problems. We then illustrate the usage of DLV as a tool for knowledge representation and reasoning, describing a new declarative programming methodology which allows one to encode complex problems (up to Δ P 3 -complete problems) in a declarative fashion. On the foundational side, we provide a detailed analysis of the computational complexity of the language of DLV, and by deriving new complexity results we chart a complete picture of the complexity of this language and important fragments thereof.Furthermore, we illustrate the general architecture of the DLV system, which has been influenced by these results. As for applications, we overview application front-ends which have been developed on top of DLV to solve specific knowledge representation tasks, and we briefly describe the main international projects investigating the potential of the system for industrial exploitation. Finally, we report about thorough experimentation and benchmarking, which has been carried out to assess the efficiency of the system. The experimental results confirm the solidity of DLV and highlight its potential for emerging application areas like knowledge management and information integration.

A computational approach to fuzzy quantifiers in natural languages

1983-01-01

Lotfi A. Zadeh

Logical Foundations of Artificial Intelligence

1987-01-01

Michael Genesereth , Nils J. Nilsson

Results on the propositional μ-calculus

1983-01-01

Dexter Kozen

Generalized Quantifiers and Natural Language

1981-01-01

Jon Barwise , Robin Cooper

Constraint logic programming: a survey

1994-05-01

Joxan Jaffar , Michael J. Maher

Dynamic predicate logic

1991-02-01

Jeroen Groenendijk , Martin Stokhof

View PDF Chat

Classical negation in logic programs and disjunctive databases

1991-08-01

Michael Gelfond , Vladimir Lifschitz

View PDF Chat

Nonmonotonic reasoning, preferential models and cumulative logics

1990-07-01

Sarit Kraus , Daniel Lehmann , Menachem Magidor

View PDF Chat

From Discourse to Logic: Introduction to Modeltheoretic Semantics of Natural Language, Formal Logic and Discourse Representation Theory

1995-12-01

Jeffrey Heath , Hans Kamp , Uwe Reyle

Preface. 0: Preliminaries. 0.1. Theories of Meaning. 0.2. Logic. 0.3. Logic and Semantics. 0.4. Syntax. 1: DRT and Predicate Logic. 1.1. Simple Sentences. 1.2. Models. 1.3. Negation. 1.4. Verification, Truth … Preface. 0: Preliminaries. 0.1. Theories of Meaning. 0.2. Logic. 0.3. Logic and Semantics. 0.4. Syntax. 1: DRT and Predicate Logic. 1.1. Simple Sentences. 1.2. Models. 1.3. Negation. 1.4. Verification, Truth and Accessibility. 1.5. From DRT to Predicate Logic. 2: Quantification and Connectives. 2.1. Conditionals. 2.2. Universal Quantification. 2.3. Disjunction. 2.4. Conjunction. 3: Loose Ends. 3.1. Reflexives. 3.2. Possessive Noun Phrases. 3.3. Proper Names. 3.4. Definite Descriptions. 3.5. Stipulated Identity and Asserted Identity. 3.6. Identity and Predication. 3.7. Scope Amibiguity. 4: The Plural. 4.1. Introduction. 4.2. DRS-Construction for Plurals I. 4.3. Model Theory. 4.4. DRS-Construction for Plurals II. 5: Tense and Aspect. 5.1. The Semantics and Logic of Temporal Reference. 5.2. DRS-Construction for Tensed Sentences. 5.3. Aspect. 5.4. Temporal Perspective. 5.5. Temporal Adverbials. 5.6. Model Theory. 5.7. Syntactic Rules. Bibliography. Table of Construction Rules. Index of Symbols, Features and Feature Values. Index of Names. Index of Subjects.

Call-by-name, call-by-value and the λ-calculus

1975-12-01

Gordon Plotkin

A Machine-Oriented Logic Based on the Resolution Principle

1965-01-01

John A. Robinson

article Free Access Share on A Machine-Oriented Logic Based on the Resolution Principle Author: J. A. Robinson Argonne National Laboratory, Argonne, Illinois and Rice University, Houston, Texas Argonne National Laboratory, … article Free Access Share on A Machine-Oriented Logic Based on the Resolution Principle Author: J. A. Robinson Argonne National Laboratory, Argonne, Illinois and Rice University, Houston, Texas Argonne National Laboratory, Argonne, Illinois and Rice University, Houston, TexasView Profile Authors Info & Claims Journal of the ACMVolume 12Issue 1pp 23–41https://doi.org/10.1145/321250.321253Published:01 January 1965Publication History 2,696citation6,808DownloadsMetricsTotal Citations2,696Total Downloads6,808Last 12 Months797Last 6 weeks75 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteeReaderPDF

A Theory of Communicating Sequential Processes

1984-06-26

Stephen Brookes , C. A. R. Hoare , A. W. Roscoe

A mathematical model for communicating sequential processes is given, and a number of its interesting and useful properties are stated and proved. The possibilities of nondetermimsm are fully taken into … A mathematical model for communicating sequential processes is given, and a number of its interesting and useful properties are stated and proved. The possibilities of nondetermimsm are fully taken into account.

View PDF Chat

On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and n-person games

1995-09-01

Phan Minh Dũng

Towards a Theory of Declarative Knowledge

1988-01-01

Krzysztof R. Apt , Howard A. Blair , Adrian Walker

View PDF Chat

Towards a general theory of action and time

1984-07-01

James F. Allen

Introduction to Logical Theory.

1953-12-01

Hugues Leblanc , P. E. Strawson

1. Logical Appraisal 2. Formal Logic 3. Truth-Functions 4. Classes: An Alternative Interpretation of the Tabular System 5. Predicative Formulae and Quantifiers 6. Subjects, Predicates, and Existence 7. General Statements … 1. Logical Appraisal 2. Formal Logic 3. Truth-Functions 4. Classes: An Alternative Interpretation of the Tabular System 5. Predicative Formulae and Quantifiers 6. Subjects, Predicates, and Existence 7. General Statements and Relations 8. Two Kinds of Logic 9. Inductive Reasoning and Probability

AgentSpeak(L): BDI agents speak out in a logical computable language

1996-01-01

Anand S. Rao

Dynamic Epistemic Logic

2007-05-05

Hans van Ditmarsch , Wiebe van der Hoek , Barteld Kooi

An overview of the KL-ONE Knowledge Representation System

1985-06-01

R. J. Brachman , James G. Schmolze

KL-ONE is a system for representing knowledge in Artificial Intelligence programs. It has been developed and refined over a long period and has been used in both basic research and … KL-ONE is a system for representing knowledge in Artificial Intelligence programs. It has been developed and refined over a long period and has been used in both basic research and implemented knowledge-based systems in a number of places in the AI community. Here we present the kernel ideas of KL-ONE, emphasizing its ability to form complex structured descriptions. In addition to detailing all of KL-ONE's description-forming structures, we discuss a bit of the philosophy underlying the system, highlight notions of taxonomy and classification that are central to it, and include an extended example of the use of KL-ONE and its classifier in a recognition task.

The complexity of satisfiability problems

1978-01-01

Thomas J. Schaefer

The problem of deciding whether a given propositional formula in conjunctive normal form is satisfiable has been widely studied. I t is known that, when restricted to formulas having only … The problem of deciding whether a given propositional formula in conjunctive normal form is satisfiable has been widely studied. I t is known that, when restricted to formulas having only two literals per clause, this problem has an efficient (polynomial-time) solution. But the same problem on formulas having three literals per clause is NP-complete, and hence probably does not have any efficient solution.

View PDF Chat

Logic for problem solving

1982-04-01

Robert Kowalski , Steve Smoliar

No abstract available. No abstract available.

Intention is choice with commitment

1990-03-01

Philip R. Cohen , Hector J. Levesque

A logic-based calculus of events

1986-03-01

Robert Kowalski , Marek Sergot

Linear logic

1987-01-01

Jean-Yves Girard

Probabilistic logic

1986-02-01

Nils J. Nilsson

Circumscription—A form of non-monotonic reasoning

1980-04-01

John McCarthy

Foundations of logic programming; (2nd extended ed.)

1987-01-10

John W. Lloyd

Foundations of Logic Programming

1987-01-01

John W. Lloyd

Generalized quantifiers and natural language

1981-01-01

Jon Barwise , Robin Cooper

Causation, Prediction, and Search

2001-01-29

Peter Spirtes , Clark Glymour , Richard Scheines

The authors address the assumptions and methods that allow us to turn observations into causal knowledge, and use even incomplete causal knowledge in planning and prediction to influence and control … The authors address the assumptions and methods that allow us to turn observations into causal knowledge, and use even incomplete causal knowledge in planning and prediction to influence and control our environment. What assumptions and methods allow us to turn observations into causal knowledge, and how can even incomplete causal knowledge be used in planning and prediction to influence and control our environment? In this book Peter Spirtes, Clark Glymour, and Richard Scheines address these questions using the formalism of Bayes networks, with results that have been applied in diverse areas of research in the social, behavioral, and physical sciences. The authors show that although experimental and observational study designs may not always permit the same inferences, they are subject to uniform principles. They axiomatize the connection between causal structure and probabilistic independence, explore several varieties of causal indistinguishability, formulate a theory of manipulation, and develop asymptotically reliable procedures for searching over equivalence classes of causal models, including models of categorical data and structural equation models with and without latent variables. The authors show that the relationship between causality and probability can also help to clarify such diverse topics in statistics as the comparative power of experimentation versus observation, Simpson's paradox, errors in regression models, retrospective versus prospective sampling, and variable selection. The second edition contains a new introduction and an extensive survey of advances and applications that have appeared since the first edition was published in 1993. Bradford Books imprint

View PDF Chat

Review of Logic, Set Theory, Isomorphism, and Natural Numbers

2025-06-25

Nicolas A. Pereyra | CRC Press eBooks

Equivalence of Lewis’ Two Kinds of Conditional Logic Systems

2025-06-23

Shuquan Huo | Studia Logica

Knowability as Continuity: A Topological Account of Informational Dependence

2025-06-23

Alexandru Baltag , Johan van Benthem | Logics

We study knowable informational dependence between empirical questions, modeled as continuous functional dependence between variables in a topological setting. We also investigate epistemic independence in topological terms and show that … We study knowable informational dependence between empirical questions, modeled as continuous functional dependence between variables in a topological setting. We also investigate epistemic independence in topological terms and show that it is compatible with functional (but non-continuous) dependence. We then proceed to study a stronger notion of knowability based on uniformly continuous dependence. On the technical logical side, we determine the complete logics of languages that combine general functional dependence, continuous dependence, and uniformly continuous dependence.

View PDF Chat

Aboutness and universal generalization

2025-06-23

Peter Hawke | Philosophy and Phenomenological Research

Abstract We motivate and present a novel semantic theory for universal generalizations (‘every is a ’), contributing to a growing theoretical line that gives equal prominence to subject matter and … Abstract We motivate and present a novel semantic theory for universal generalizations (‘every is a ’), contributing to a growing theoretical line that gives equal prominence to subject matter and truth conditions when modelling propositional content. Our proposed theory aligns with the presently dominant linguistic programme for capturing natural language quantifiers (the generalized quantifier framework) and demonstrably respects a package of influential theses on subject matter (e.g. that a subject matter corresponds to a set of basic questions), many of which extend in interesting and natural ways to the quantified setting. Along the way, we take a principled stand on some divisive issues: most notably, we follow Nelson Goodman in denying that universal generalizations are about individuals, relative to the domain of quantification.

Generalization-based similarity

2025-06-20

Christian Antić | Annals of Mathematics and Artificial Intelligence

Abstract Detecting and exploiting similarities between seemingly distant objects is without doubt an important human ability. This paper develops from the ground up an abstract algebraic and qualitative notion of … Abstract Detecting and exploiting similarities between seemingly distant objects is without doubt an important human ability. This paper develops from the ground up an abstract algebraic and qualitative notion of similarity based on the observation that sets of generalizations encode important properties of elements. We show that similarity defined in this way has appealing mathematical properties. As we construct our notion of similarity from first principles using only elementary concepts of universal algebra, to convince the reader of its plausibility, we show that it can model fundamental relations occurring in mathematics and can be naturally embedded into first-order logic via model-theoretic types. Finally, we sketch some potential applications to theoretical computer science and artificial intelligence.

Inquisitive Conditional Logics

2025-06-20

Karl Nygren | Journal of Philosophical Logic

Abstract Many traditional semantic theories of conditionals can be seen as determining how to assign propositions to conditional sentences based on the propositions expressed by their antecedents and consequents. As … Abstract Many traditional semantic theories of conditionals can be seen as determining how to assign propositions to conditional sentences based on the propositions expressed by their antecedents and consequents. As shown by Ciardelli ( Semantics and Linguistic Theory (SALT) , 26 , 732–752, 2016b), such traditional semantic theories of conditionals are naturally lifted to the setting of inquisitive semantics. In the resulting account, antecedents and consequents may be associated with multiple alternative propositions. A conditional sentence is then taken to express that for each alternative for the antecedent, if that alternative were to obtain, then some corresponding alternative for the consequent would also obtain. This paper studies the inquisitive conditional logics that result from applying Ciardelli’s lifting recipe to a Kripke-style semantics for conditional logic that interprets conditionals in terms of relative necessity. The main results of the paper are sound and complete axiomatizations, both for the inquisitive conditional logic over the class of all models, and for various stronger logics obtained by imposing additional semantic conditions. Among the logics considered in the paper are inquisitive versions of conditional logics due to Lewis and Stalnaker.

Reasoned Change in Logic

2025-06-20

Elijah Chudnoff | Routledge eBooks

Common Belief in Rationality with Incomplete Information

2025-06-17

| Cambridge University Press eBooks

Procedural Reglementation of an Exigent Circumstances Search

2025-06-16

Andrii Hachkevych , Serhii Voitsekhivskyi | Visnik Nacional’nogo universitetu «Lvivska politehnika» Seria Uridicni nauki

This article is devoted to the relevant issue of the legality of an exigent circumstances search, a practice that involves entering a home or other possessions to save life and … This article is devoted to the relevant issue of the legality of an exigent circumstances search, a practice that involves entering a home or other possessions to save life and property, or to directly prosecute a suspected criminal. The inclusion of provisions on exigent circumstances searches in the legislation of Ukraine is a matter of great importance, as it directly impacts the effectiveness of law enforcement agencies in responding to emerging threats. However, this issue also faces challenges, particularly in relation to the need to respect human rights, such as the right to inviolability of the home, which necessitates the establishing of the boundaries of law enforcement personnel activities. This article provides a comprehensive analysis of the provisions of the Criminal Procedural Code of Ukraine regarding exigent circumstances searches, as well as related concepts of saving property, urgent measures, and continuous persecution of a person. The authors identify several provisions which they propose to improve, including the provisions of article 233. They also address terminological inaccuracies and contradictions in the legislation of Ukraine, including those between the Constitution of Ukraine and the Criminal Procedural Code of Ukraine. The current state of the legal regulation of exigent circumstances searches often leads to such negative phenomena as the formation of inconsistent practice, manifested even in the absence of a single list of criteria for issuing a search warrant in such cases, and also to improper exercise of powers by law enforcement agencies. This article specifies some of the scholar' views on improving the criminal procedural legislation of Ukraine in order to avoid different interpretations of its provisions on exigent circumstances entry into a person's home or other possessions and search thereof, and also to provide additional guarantees of human rights. The authors suggest specific amendments to the current criminal procedural legislation, such as specifying the legal grounds for such search and strengthening judicial control over law enforcement personnel activities. Keywords: exigent circumstances search, entry into the house, rescue of property, continuous persecution of persons, urgent measures, inviolability of the home, Article 233 of the Criminal Procedure Code of Ukraine, criminal procedural legislation.

Projection or admittance? Presupposition accommodation and the Karttunen calculus

2025-06-14

Yoad Winter | Linguistics and Philosophy

Abstract This paper examines two approaches to presuppositions: one viewing them as inferences projecting from sentences under negation and other logical operators, and another defining them as admittance conditions of … Abstract This paper examines two approaches to presuppositions: one viewing them as inferences projecting from sentences under negation and other logical operators, and another defining them as admittance conditions of utterances. Neither approach fully accounts for the “proviso problem”, which arises when a sentence’s presuppositional inferences are logically stronger than its necessary admittance conditions. To address this challenge, we propose a calculus of a trivalent logic that formally distinguishes between admittance and projection, extending Karttunen’s dynamic, logical form-based analysis. The resulting framework enables a simple pragmatic strategy: presuppositional conclusions are accommodated unless overridden by a contextually likelier admittance condition. We provide evidence that this approach is empirically superior to methods that address the proviso problem using pragmatic strengthening.

Natural revision is contingently-conditionalized revision

2025-06-03

Paolo Liberatore | International Journal of Approximate Reasoning

Logical Omniscience as a Conditionality Issue. A Multi-Modal Approach

2025-06-02

Juan Carlos Sánchez Hernández | Deleted Journal

Many solutions to the problem of Logical Omniscience assume that this arises from the behavior of the epistemic operators. However, few proposals have criticized the assumption that material implication accurately … Many solutions to the problem of Logical Omniscience assume that this arises from the behavior of the epistemic operators. However, few proposals have criticized the assumption that material implication accurately accounts for conditionality. This paper aims to show how Multi-Modal Logic can be used to criticize this assumption. After reviewing a kind of fusion semantics that incorporates a set of epistemic states to the models, serious systems of Multi-Modal Logic are used to criticize both the validity of Closure Principles for Knowledge and Belief and a version of Logical Omniscience that uses the strict conditional. The machinery is also modified to explore Logical Omniscience in logics based on Conditional Logic, Intuitionistic Logic, and a pair of weak Relevant Logics.

Evolutionary learning of probabilistic logic programs

2025-06-01

Damiano Azzolini | Knowledge-Based Systems

Unit refutability of Horn Constraint Systems - Certification and Parallel Complexity

2025-06-01

Piotr Wojciechowski , K. Subramani | Theoretical Computer Science

Unification of Talking-About and Talking-To

2025-05-29

Li‐An Zhou | American Philosophical Quarterly

Abstract This paper proposes a new condition for the correct use of the second-person singular pronoun “you.” The current consensus among philosophers is that a mutual awareness between a speaker … Abstract This paper proposes a new condition for the correct use of the second-person singular pronoun “you.” The current consensus among philosophers is that a mutual awareness between a speaker and her audience is the condition for the felicitous use of “you.” However, existing proposals based on this consensus are unsatisfactory. They either confuse a condition for the correct use of “you” with a condition for a successful conversation, or are not well defended. The proposal presented by this paper is called the unification condition, which brings together two constituents: what a speaker intends to talk about and whom a speaker talks to. This condition is more accurate compared with other proposals, and it can respond to challenges to which other proposals fail to respond.

Generics are not existentially quantified

2025-05-29

Olivier Lemeire , Jan Heylen , Leander Vignero | Mind & Language

According to the standard view, generics such as “ravens are black” express quite strong generalizations, even if they do allow for some exceptions. Nickel, however, defends a semantic theory for … According to the standard view, generics such as “ravens are black” express quite strong generalizations, even if they do allow for some exceptions. Nickel, however, defends a semantic theory for generics that radically departs from this standard view, claiming that they express existentially quantified generalizations. We argue against this existential view and in favor of a more standard view according to which generics express universally quantified normality generalizations. We consider five phenomena involving generic sentences and argue that our universal view explains each of these phenomena better than or at least equally well as Nickel's existential view.

Meet MASKS: integrating distributed knowledge and verification for multi-agent systems

2025-05-27

Majid Alizadeh , Amirhoshang Hoseinpour Dehkordi , Ali Movaghar

Uneventful: Event Semantics for “Qua”

2025-05-26

Annina Loets

ABSTRACT Event semantics promise a straightforward account of the truth conditions of qualifications with “as” or “qua” as well as the inferences such qualifications license. In this paper, I argue … ABSTRACT Event semantics promise a straightforward account of the truth conditions of qualifications with “as” or “qua” as well as the inferences such qualifications license. In this paper, I argue that these promises are difficult to keep. On natural ways of developing the view, an event semantics of qualification yields either the wrong predictions about the truth conditions and logic of qualification or next to no predictions. Qua‐qualifictions, I conclude, are sensitive to the meanings of the qualifying and qualified predicates in a way which resists all but a very schematic general analysis.

A Unified Relational Semantics for BPL, IPL and OL: Axiomatization Without Disjunction

2025-05-26

Z Chen

From Jaśkowski’s Discussive Logic to Contemporary Paraconsistent Systems

2025-05-26

Marek Nasieniewski , Andrzej Pietruszczak

Fragmentation and expression

2025-05-22

Peter Hawke

Believing in default rules: inclusive default reasoning

2025-05-22

Frederik J. Andersen , Rasmus K. Rendsvig

ASP-Based Multi-Shot Reasoning via DLV2 with Incremental Grounding

2025-05-21

Francesco Calimeri , Giovambattista Ianni , Francesco Pacenza +2 more

Abstract DLV2 is an AI tool for knowledge representation and reasoning that supports answer set programming (ASP) – a logic-based declarative formalism, successfully used in both academic and industrial applications. … Abstract DLV2 is an AI tool for knowledge representation and reasoning that supports answer set programming (ASP) – a logic-based declarative formalism, successfully used in both academic and industrial applications. Given a logic program modeling a computational problem, an execution of DLV2 produces the so-called answer sets that correspond one-to-one to the solutions to the problem at hand. The computational process of DLV2 relies on the typical ground & solve approach, where the grounding step transforms the input program into a new, equivalent ground program, and the subsequent solving step applies propositional algorithms to search for the answer sets. Recently, emerging applications in contexts such as stream reasoning and event processing created a demand for multi-shot reasoning: here, the system is expected to be reactive while repeatedly executed over rapidly changing data. In this work, we present a new incremental reasoner obtained from the evolution of DLV2 toward iterated reasoning. Rather than restarting the computation from scratch, the system remains alive across repeated shots, and it incrementally handles the internal grounding process. At each shot, the system reuses previous computations for building and maintaining a large, more general ground program, from which a smaller yet equivalent portion is determined and used for computing answer sets. Notably, the incremental process is performed in a completely transparent fashion for the user. We describe the system, its usage, its applicability, and performance in some practically relevant domains.

Semantic Foundations of Reductive Reasoning

2025-05-20

Alexander V. Gheorghiu , David Pym

Reasoning with system W and infeasible worlds

2025-05-15

Jonas Haldimann , Christoph Beierle , Gabriele Kern-Isberner +1 more

Iterated probability revision and the limitations of dyadic probability

2025-05-14

Sven Ove Hansson | Logic Journal of IGPL

Abstract Primitive dyadic (two-place) probability functions have been proposed both as representations of conditional probability and as tools for modelling iterated probability revision. However, the usefulness of dyadic probability functions … Abstract Primitive dyadic (two-place) probability functions have been proposed both as representations of conditional probability and as tools for modelling iterated probability revision. However, the usefulness of dyadic probability functions for these purposes is limited by the problems involved in updating with propositions whose prior probability is zero. These limitations are investigated and specified. They turn out to be more serious for the use of dyadic probability functions to represent probability revision than for their use as representations of conditional probability.

A Lindström Theorem for the Hybrid Logic $$\mathcal {H}(\exists )$$

2025-05-14

Diego Pinheiro Fernandes

Integrated Use of System Z for Preferred Answer Set Programming

2025-05-14

Marco Wilhelm , Andre Thevapalan , Gabriele Kern-Isberner

Answer set programming (ASP) and conditional reasoning are powerful KR formalisms capable of expressing default statements that usually hold but also allow for exceptions. While ASP excels with an intuitive … Answer set programming (ASP) and conditional reasoning are powerful KR formalisms capable of expressing default statements that usually hold but also allow for exceptions. While ASP excels with an intuitive rule-based syntax, fast solvers, and is suited to solve complex combinatorial search problems, conditionals provide a sophisticated preference-based semantics and yield principled inferences. In this paper, we investigate and compare different computational approaches on utilizing conditional background knowledge in order to prioritize the solutions of ASP programs. For this, we compile the specification of the System Z ranking model of conditionals into ASP constraints and, therewith, integrate the guidelines for prioritization according to System Z directly into the ASP programs.

Generalized Epstein Semantics for Parry Systems

2025-05-14

Nicolò Zamperlin

Logic Puzzles and Games

2025-05-14

Marcel Danesi