Results 21 to 30 of about 421,883 (287)
Proof Complexity of Propositional Default Logic [PDF]
, 2010 Default logic is one of the most popular and successful formalisms for non-monotonic reasoning. In 2002, Bonatti and Olivetti introduced several sequent calculi for credulous and skeptical reasoning in propositional default logic.
Beyersdorff, O +4 more
core +3 more sources
THE USE OF FUZZY LOGIC WHILE MODELING THE CREDITWORTHINESS OF LEGAL ENTITIES
Green, Blue and Digital Economy Journal, 2020 The purpose of the article is to develop a methodological approach to support the decision-making process in determining the creditworthiness of legal entities, as well as to create economic mathematical models based on this approach using the theory of
Olga Palamarchuk
doaj +1 more source
Strong Backdoors for Default Logic [PDF]
ACM Transactions on Computational Logic, 2016 In this article, we introduce a notion of backdoors to Reiter’s propositional default logic and study structural properties of it. Also we consider the problems of backdoor detection (parameterised by the solution size) as well as backdoor evaluation (parameterised by the size of the given backdoor) for various kinds of target classes (CNF, KROM ...
Johannes Klaus Fichte +2 more
openaire +2 more sources
PRX Quantum, 2021 Quantum computers promise tremendous impact across applications—and have shown great strides in hardware engineering—but remain notoriously error prone.
Yuval Baum +8 more
doaj +1 more source
Compiling With Classical Connectives [PDF]
Logical Methods in Computer Science, 2020 The study of polarity in computation has revealed that an "ideal" programming language combines both call-by-value and call-by-name evaluation; the two calling conventions are each ideal for half the types in a programming language.
Paul Downen, Zena M. Ariola
doaj +1 more source
Default logic and bounded treewidth [PDF]
Information and Computation, 2018 In this paper, we study Reiter's propositional default logic when the treewidth of a certain graph representation (semi-primal graph) of the input theory is bounded. We establish a dynamic programming algorithm on tree decompositions that decides whether a theory has a consistent stable extension (Ext).
Fichte, Johannes K. +2 more
openaire +2 more sources
PLoS ONE, 2021 BackgroundHealthcare purchasers such as health insurers and governmental bodies are expected to strategically manage chronic care chains. In doing so, purchasers can contribute to the goal of improving task division and collaboration between chronic care
Bart A C Noort +2 more
doaj +1 more source
Bankruptcy Prediction of Industrial Industry in the UK
Sriwijaya International Journal of Dynamic Economics and Business, 2017 We make comparison between 6 models including (1) Altman's (1968) z-score; (2) Model 1: z-score model with adjusted coefficients; (3) Model 2: z-score model with modified variables; (4) Model 3: dynamic logic model; (5) Merton distance to default (DD ...
Wong Ming Nok
doaj +1 more source
Induction and Confirmation Theory: An Approach based on a Paraconsistent Nonmonotonic Logic [PDF]
Princípios, 2010 This paper is an effort to realize and explore the connections that exist between nonmonotonic logic and confirmation theory. We pick up one of the most wide-spread nonmonotonic formalisms – default logic – and analyze to what extent and under what ...
Ricardo Sousa Silvestre
doaj
An Implementation of a Non-monotonic Logic in an Embedded Computer for a Motor-glider [PDF]
Electronic Proceedings in Theoretical Computer Science, 2019 In this article we present an implementation of non-monotonic reasoning in an embedded system. As a part of an autonomous motor-glider, it simulates piloting decisions of an airplane.
José Luis Vilchis Medina +3 more
doaj +1 more source