English
Related papers

Related papers: An Application Specific Informal Logic for Interes…

200 papers

It is argued that arguments for strict prohibition of interests must be based on the use of arguments from authority. This is carried out by first making a survey of so-called dialectical roots for interest prohibition and then…

General Finance · Quantitative Finance 2011-05-17 Jan Aldert Bergstra

We give a rough sketch of the Judaic, Greek, Islamic and Christian positions in the matter of interest prohibition during the last few millennia and discuss the way in which interest prohibition is dealt with in Islamic finance, the…

General Finance · Quantitative Finance 2012-12-03 J. A. Bergstra , C. A. Middelburg

Intentions are crucial for our practical reasoning. The rational intention obeys some simple logical principles, such as agglomeration and consistency, among others, motivating the search for a proper logic of intention. However, such a…

Logic in Computer Science · Computer Science 2025-12-01 Daniil Khaitovich , Aybüke Özgün

Possibility theory offers a framework where both Lehmann's "preferential inference" and the more productive (but less cautious) "rational closure inference" can be represented. However, there are situations where the second inference does…

Artificial Intelligence · Computer Science 2013-02-18 Salem Benferhat , Didier Dubois , Henri Prade

In this paper we discuss contrastive explanations for formal argumentation - the question why a certain argument (the fact) can be accepted, whilst another argument (the foil) cannot be accepted under various extension-based semantics. The…

Artificial Intelligence · Computer Science 2022-01-26 AnneMarie Borg , Floris Bex

Formal logic has often been seen as uniquely placed to analyze mathematical argumentation. While formal logic is certainly necessary for a complete understanding of mathematical practice, it is not sufficient. Important aspects of…

History and Overview · Mathematics 2024-05-06 Andrew Aberdein , Zoe Ashton

A logic calculus is presented that is a conservative extension of linear logic. The motivation beneath this work concerns lazy evaluation, true concurrency and interferences in proof search. The calculus includes two new connectives to deal…

Logic in Computer Science · Computer Science 2007-06-25 Christophe Fouqueré

Existential fixed point logic (EFPL) is a natural fit for some applications, and the purpose of this talk is to attract attention to EFPL. The logic is also interesting in its own right as it has attractive properties. One of those…

Logic in Computer Science · Computer Science 2008-11-07 Andreas Blass , Yuri Gurevich

The introduction of explicit notions of rejection, or disbelief, into logics for knowledge representation can be justified in a number of ways. Motivations range from the need for versions of negation weaker than classical negation, to the…

Artificial Intelligence · Computer Science 2007-05-23 Samir Chopra , Johannes Heidema , Thomas Meyer

Although conventional logical systems based on logical calculi have been successfully used in mathematics and beyond, they have definite limitations that restrict their application in many cases. For instance, the principal condition for…

Logic in Computer Science · Computer Science 2011-04-11 Mark Burgin , Kees , de Vey Mestdagh

We investigate the limitations of random trials when the cause of interest is confounded with the effect by formalizing a counterfactual policy-space where the agent's natural predilection is input to a soft-intervention.

Artificial Intelligence · Computer Science 2022-06-07 Erik Skalnes

Reasoning about exceptions in ontologies is nowadays one of the challenges the description logics community is facing. The paper describes a preferential approach for dealing with exceptions in Description Logics, based on the rational…

Artificial Intelligence · Computer Science 2018-07-10 Laura Giordano , Valentina Gliozzi

The class of defeasible logics is only vaguely defined -- it is defined by a few exemplars and the general idea of efficient reasoning with defeasible rules. The recent definition of the defeasible logic $DL(\partial_{||})$ introduced new…

Logic in Computer Science · Computer Science 2024-05-30 Michael J. Maher

The standard notion of formal theory, in Logic, is in general biased exclusively towards assertion: it commonly refers only to collections of assertions that any agent who accepts the generating axioms of the theory should also be committed…

Logic · Mathematics 2019-04-04 Carolina Blasio , Carlos Caleiro , João Marcos

We will investigate proof-theoretic and linguistic aspects of first-order linear logic. We will show that adding partial order constraints in such a way that each sequent defines a unique linear order on the antecedent formulas of a sequent…

Logic in Computer Science · Computer Science 2020-08-17 Richard Moot

Informal logic is a method of argument analysis which is complementary to that of formal logic, providing for the pragmatic treatment of features of argumentation which cannot be reduced to logical form. The central claim of this paper is…

History and Overview · Mathematics 2019-05-03 Andrew Aberdein

Standard models of multi-agent modal logic do not capture the fact that information is often \emph{ambiguous}, and may be interpreted in different ways by different agents. We propose a framework that can model this, and consider different…

Artificial Intelligence · Computer Science 2014-01-10 Joseph Y. Halpern , Willemien Kets

Defeasible logics provide several linguistic features to support the expression of defeasible knowledge. There is also a wide variety of such logics, expressing different intuitions about defeasible reasoning. However, the logics can only…

Logic in Computer Science · Computer Science 2021-02-16 Guido Governatori , Michael J. Maher

This paper motivates the study of decision theory as necessary for aligning smarter-than-human artificial systems with human interests. We discuss the shortcomings of two standard formulations of decision theory, and demonstrate that they…

Artificial Intelligence · Computer Science 2015-07-09 Nate Soares , Benja Fallenstein

This paper explores goal-directed proof search in first-order multi-modal logic. The key issue is to design a proof system that respects the modularity and locality of assumptions of many modal logics. By forcing ambiguities to be…

Logic in Computer Science · Computer Science 2007-05-23 Matthew Stone
‹ Prev 1 2 3 10 Next ›