Search

Your search keyword '"propositional logic"' showing total 1,516 results
Start Over Descriptor "propositional logic"
1,516 results on '"propositional logic"'

101. Equality Logic and Uninterpreted Functions

Author

Kroening, Daniel, Strichman, Ofer, Henzinger, Monika, Series editor, Hromkovič, Juraj, Series editor, Nielsen, Mogens, Series editor, Rozenberg, Grzegorz, Series editor, Salomaa, Arto, Series editor, Kroening, Daniel, and Strichman, Ofer

Published
2016
Full Text
View/download PDF

102. Introduction and Basic concepts

Author

Kroening, Daniel, Strichman, Ofer, Henzinger, Monika, Series editor, Hromkovič, Juraj, Series editor, Nielsen, Mogens, Series editor, Rozenberg, Grzegorz, Series editor, Salomaa, Arto, Series editor, Kroening, Daniel, and Strichman, Ofer

Published
2016
Full Text
View/download PDF

103. Decision Procedures for Propositional Logic

Author

Kroening, Daniel, Strichman, Ofer, Henzinger, Monika, Series editor, Hromkovič, Juraj, Series editor, Nielsen, Mogens, Series editor, Rozenberg, Grzegorz, Series editor, Salomaa, Arto, Series editor, Kroening, Daniel, and Strichman, Ofer

Published
2016
Full Text
View/download PDF

105. A Short History of Logic

Author

O’Regan, Gerard, Gries, David, Series editor, Hazzan, Orit, Series editor, Schneider, Fred B., Series editor, and O'Regan, Gerard

Published
2016
Full Text
View/download PDF

106. Forgetting-Based Inconsistency Measure

Author

Besnard, Philippe, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Weikum, Gerhard, Series editor, Schockaert, Steven, editor, and Senellart, Pierre, editor

Published
2016
Full Text
View/download PDF

107. 'Boring Formal Methods' or 'Sherlock Holmes Deduction Methods'?

Author

Spichkova, Maria, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Weikum, Gerhard, Series editor, Milazzo, Paolo, editor, Varró, Dániel, editor, and Wimmer, Manuel, editor

Published
2016
Full Text
View/download PDF

108. Finite-Trace Linear Temporal Logic: Coinductive Completeness

Author

Roşu, Grigore, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Weikum, Gerhard, Series editor, Falcone, Yliès, editor, and Sánchez, César, editor

Published
2016
Full Text
View/download PDF

109. Related Work

Author

Ognjanović, Zoran, Rašković, Miodrag, Marković, Zoran, Ognjanović, Zoran, Rašković, Miodrag, and Marković, Zoran

Published
2016
Full Text
View/download PDF

111. On Computing All Abductive Explanations from a Propositional Horn Theory.

Author

Eiter, Thomas and Makino, Kazuhisa

Subjects
ALGORITHMS, MONOTONE operators, POLYNOMIALS, ALGEBRA, COMPUTER logic, MATHEMATICAL logic
Abstract

Abduction is a fundamental mode of reasoning with applications in many areas of AI and Computer Science. The computation of abductive explanations is an important computational problem, which is at the core of early systems such as the ATMS and Clause Management Systems and is intimately related to prime implicate generation in propositional logic. Many algorithms have been devised for computing some abductive explanation, and the complexity of the problem has been well studied. However, little attention has been paid to the problem of computing multiple explanations, and in particular all explanations for an abductive query. We fill this gap and consider the computation of all explanations of an abductive query from a propositional Horn theory, or of a polynomial subset of them. Our study pays particular attention to the form of the query, ranging from a literal to a compound formula, to whether explanations are based on a set of abducible literals and to the representation of the Horn theory, either by a Horn conjunctive normal form (CNF) or model-based in terms of its characteristic models. For these combinations, we present either tractability results in terms of polynomial total-time algorithms, intractability results in terms of nonexistence of such algorithms (unless P = NP), or semi-tractability results in terms of solvability in quasi-polynomial time, established by polynomial-time equivalence to the problem of dualizing a monotone CNF expression. Our results complement previous results in the literature, and refute a longstanding conjecture by Selman and Levesque. They elucidate the complexity of generating all abductive explanations and shed light on related problems such as generating sets of restricted prime implicates of a Horn theory. The algorithms for tractable cases can be readily applied for generating a polynomial subset of explanations in polynomial time. [ABSTRACT FROM AUTHOR]

Published
2007
Full Text
View/download PDF

112. Resolution Lower Bounds for the Weak Pigeonhole Principle.

Author

Raz, Ran

Subjects
COMPUTATIONAL complexity, PROOF theory, THEORY, MATHEMATICAL logic, PROPOSITION (Logic)
Abstract

We prove that any Resolution proof for the weak pigeonhole principle, with n holes and any number of pigeons, is of length ω(2n∈), (for some global constant ∈ > 0). One corollary is that a certain propositional formulation of the statement NP ⊄ P/poly does not have short Resolution proofs. [ABSTRACT FROM AUTHOR]

Published
2004
Full Text
View/download PDF

113. Propositional Kernels

Author

Mirko Polato and Fabio Aiolli

Subjects
propositional kernels, boolean kernels, kernel methods, categorical data, propositional logic, Science, Astrophysics, QB460-466, Physics, QC1-999
Abstract

The pervasive presence of artificial intelligence (AI) in our everyday life has nourished the pursuit of explainable AI. Since the dawn of AI, logic has been widely used to express, in a human-friendly fashion, the internal process that led an (intelligent) system to deliver a specific output. In this paper, we take a step forward in this direction by introducing a novel family of kernels, called Propositional kernels, that construct feature spaces that are easy to interpret. Specifically, Propositional Kernel functions compute the similarity between two binary vectors in a feature space composed of logical propositions of a fixed form. The Propositional kernel framework improves upon the recent Boolean kernel framework by providing more expressive kernels. In addition to the theoretical definitions, we also provide an algorithm (and the source code) to efficiently construct any propositional kernel. An extensive empirical evaluation shows the effectiveness of Propositional kernels on several artificial and benchmark categorical data sets.

Published
2021
Full Text
View/download PDF

114. A Deletion Algorithm for the Marginal Problem in Propositional Logic Based on Boolean Arrays

Author

Moral, Efraín Díaz-Macías and Serafín

Subjects
marginal problem, satisfiability problem, propositional logic, propagation algorithm, calculus with potentials
Abstract

This paper proposes a deletion algorithm for the marginal problem in propositional logic. The algorithm is based on the general Davis and Putnam deletion algorithm DP, expressed as a bucket elimination algorithm, representing sets of clauses with the same set of variables employing a Boolean array. The main contribution is the development of alternative procedures when deleting a variable which allow more efficient computations. In particular, it takes advantage of the case in which the variable to delete is determined by a subset of the rest of the variables. It also provides a set of useful results and tools for reasoning with Boolean tables. The algorithms are implemented using Python and the NumPy library. Experiments show that this procedure is feasible for intermediate problems and for difficult problems from hard Bayesian networks cases

Published
2023
Full Text
View/download PDF

115. A Comprehensive Formalization of Propositional Logic in Coq: Deduction Systems, Meta-Theorems, and Automation Tactics

Author

Yu, Dakai Guo and Wensheng

Subjects
Coq, formalization, propositional logic, theorem proving, Hilbert-style axiom system, natural deduction system, completeness theorem, automated tactics
Abstract

The increasing significance of theorem proving-based formalization in mathematics and computer science highlights the necessity for formalizing foundational mathematical theories. In this work, we employ the Coq interactive theorem prover to methodically formalize the language, semantics, and syntax of propositional logic, a fundamental aspect of mathematical reasoning and proof construction. We construct four Hilbert-style axiom systems and a natural deduction system for propositional logic, and establish their equivalences through meticulous proofs. Moreover, we provide formal proofs for essential meta-theorems in propositional logic, including the Deduction Theorem, Soundness Theorem, Completeness Theorem, and Compactness Theorem. Importantly, we present an exhaustive formal proof of the Completeness Theorem in this paper. To bolster the proof of the Completeness Theorem, we also formalize concepts related to mappings and countability, and deliver a formal proof of the Cantor–Bernstein–Schröder theorem. Additionally, we devise automated Coq tactics explicitly designed for the propositional logic inference system delineated in this study, enabling the automatic verification of all tautologies, all internal theorems, and the majority of syntactic and semantic inferences within the system. This research contributes a versatile and reusable Coq library for propositional logic, presenting a solid foundation for numerous applications in mathematics, such as the accurate expression and verification of properties in software programs and digital circuits. This work holds particular importance in the domains of mathematical formalization, verification of software and hardware security, and in enhancing comprehension of the principles of logical reasoning.

Published
2023
Full Text
View/download PDF

116. Multi-plataform Interface to an ITS of Proposicional Logic Teaching

Author

Galafassi, Fabiane F. P., Santos, Alan Velasques, Peres, Rafael Koch, Vicari, Rosa Maria, Gluz, João Carlos, Bajo, Javier, editor, Hallenborg, Kasper, editor, Pawlewski, Pawel, editor, Botti, Vicente, editor, Sánchez-Pi, Nayat, editor, Duque Méndez, Nestor Darío, editor, Lopes, Fernando, editor, and Julian, Vicente, editor

Published
2015
Full Text
View/download PDF

119. Complexity of Propositional Independence and Inclusion Logic

Author

Hannula, Miika, Kontinen, Juha, Virtema, Jonni, Vollmer, Heribert, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Weikum, Gerhard, Series editor, Italiano, Giuseppe F, editor, Pighizzini, Giovanni, editor, and Sannella, Donald T., editor

Published
2015
Full Text
View/download PDF

120. Automated Reasoning Building Blocks

Author

Weidenbach, Christoph, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Weikum, Gerhard, Series editor, Meyer, Roland, editor, Platzer, André, editor, and Wehrheim, Heike, editor

Published
2015
Full Text
View/download PDF

121. Symbolic Causality Checking Using Bounded Model Checking

Author

Beer, Adrian, Heidinger, Stephan, Kühne, Uwe, Leitner-Fischer, Florian, Leue, Stefan, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Weikum, Gerhard, Series editor, Fischer, Bernd, editor, and Geldenhuys, Jaco, editor

Published
2015
Full Text
View/download PDF

122. Smallest MUS Extraction with Minimal Hitting Set Dualization

Author

Ignatiev, Alexey, Previti, Alessandro, Liffiton, Mark, Marques-Silva, Joao, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Weikum, Gerhard, Series editor, and Pesant, Gilles, editor

Published
2015
Full Text
View/download PDF

123. The Formal System of Dijkstra and Scholten

Author

Rocha, Camilo, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Weikum, Gerhard, Series editor, Martí-Oliet, Narciso, editor, Ölveczky, Peter Csaba, editor, and Talcott, Carolyn, editor

Published
2015
Full Text
View/download PDF

125. Reduction-Based Approaches to Implement Modgil’s Extended Argumentation Frameworks

Author

Dvořák, Wolfgang, Gaggl, Sarah Alice, Linsbichler, Thomas, Wallner, Johannes Peter, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Kobsa, Alfred, Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Nierstrasz, Oscar, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Weikum, Gerhard, Series editor, Goebel, Randy, Series editor, Tanaka, Yuzuru, Series editor, Wahlster, Wolfgang, Series editor, Siekmann, Jörg, Series editor, Eiter, Thomas, editor, Strass, Hannes, editor, Truszczyński, Mirosław, editor, and Woltran, Stefan, editor

Published
2015
Full Text
View/download PDF

127. Constrained Pseudo-Propositional Logic.

Author

Azizi-Sultan, Ahmad-Saher

Abstract

Propositional logic, with the aid of SAT solvers, has become capable of solving a range of important and complicated problems. Expanding this range, to contain additional varieties of problems, is subject to the complexity resulting from encoding counting constraints in conjunctive normal form (CNF). Due to the limitation of the expressive power of propositional logic, generally, such an encoding increases the numbers of variables and clauses excessively. This work eliminates the indicated drawback by interpolating constraint symbols and the set of natural numbers N into the alphabet of propositional logic and adjusting the underlying language accordingly. In the extended logic counting constraints are naturally formulated, while many important aspects, such as Boolean nature and the soundness and completeness theorems, are kept preserved. [ABSTRACT FROM AUTHOR]

Published
2020
Full Text
View/download PDF

128. Relationsanalyse (RELAN) - Aussagenlogische, statistische und kausale Analyse von Daten

Author

Rainer Maderthaner

Subjects
statistical evaluation, simulation, exploration, propositional logic, variable relations
Abstract

Einleitung: Seit der Einführung des Korrelationskoeffizienten, wurde er in Millionen von biologischen, soziologischen und psychologischen Studien verwendet. Viele komplexe statistische Methoden wie Faktorenanalyse, Regressionsanalyse, Strukturgleichungsmodellierung basieren auf dem Korrelationskoeffizienten - trotz seiner statistischen Schwächen (oft nur Linearität, Abhängigkeit von Verteilungen, Symmetrie der Assoziation, Paarassoziationen, fehlende kausale Interpretierbarkeit). Einige alternative nicht-parametrische Assoziationskonzepte wurden vorgeschlagen (CFA (Krauth & Lienert, 1973), Bayesian Analysis (Phillips, 1974), Inductive Item Tree Analysis (van Leeuwe, 1974; Schrepp, 2003), Boolean Analysis (Flament, 1976), HYPAG (Ortner, Mattes & Wottawa, 1980), Aussagenlogische Analyse von Kontingenztafeln (Eye & Brandstätter, 1984), Prädiktionsanalyse (Hildebrand, Laing & Rosenthal, 1977; Eye, 1991). Methode: Relationsanalyse – RELAN – (Maderthaner, 2022) ist eine neue multivariate, multifunktionale nicht-parametrische statistische Auswertungsmethode, welche auf Aussagenlogik basiert, somit auf verbal formulierte Hypothesen anwendbar ist, und eine realistischere Prüfung von Kausalhypothesen zulässt. Die verfügbare Programmversion (www.relan.at) erlaubt das Testen und Simulieren von Hypothesen (mit bis zu zehn Variablen), die Exploration von logischen Zusammenhängen ("Data Mining") sowie das richtungs- und zeitabhängige Testen von Ursache-Wirkungs-Hypothesen. Ergebnisse: Computersimulationen zeigen, dass korrelative Assoziationsmaße nicht in der Lage sind, einfache und komplexe logische Gesetzmäßigkeiten sowie gerichtete kausale Abhängigkeiten zwischen Variablen aufzufinden. Fazit: Relationsanalysen erlauben eine erschöpfende logische Analyse eines Variablensystems, bei der insbesondere Effekte von Ursachen, Mediatoren, Moderatoren und Wirkungsbedingungen statistisch evaluiert werden können. Maderthaner, R. (2022). Relationsanalyse (RELAN) – Aussagenlogische, statistische und kausale Analyse von Daten Download of the program “RELAN Beta 1.0”: www.relan.at Keywords: Statistical method, variable relations, propositional logic, simulation, cause-effect, exploration

Published
2023
Full Text
View/download PDF

129. Logic in the NJKV Scripture. The Gospel According to Mark 16:16

Author

Kavinsky, V.V.

Subjects
Greek manuscript of the New Testament (edited by R. Stephanus, доказательство от противного, древнегреческий манускрипт Нового Завета (под ред. Р. Стефануса, логика высказываний, Священное Писание (NKJV), 1550), necessary and sufficient conditions, Holy Scriptures (NKJV), propositional logic, необходимые и достаточные условия, proof by contradiction
Abstract

The article proves that men's salvation is possible only through their faith and baptism. The study is based on one verse of the New Testament Scripture of the New Version of the King James Bible (NKJV)—the Gospel According to Mark 16:16. This verse is translated from the ancient Greek manuscript of the New Testament (edited by R. Stephanus, 1550). The main result is that the necessary and sufficient conditions for the salvation of each person are proved., В статье доказывается, что спасение человека возможно только через его веру и крещение. За основание исследования взят один стих Священного Писания Нового Завета новой версии Библии короля Иакова (NKJV) — Евангелие от Марка 16:16. Этот стих переведён из древнегреческого манускрипта Нового Завета (под ред. Р. Стефануса, 1550 г.). Главный результат — доказаны необходимые и достаточные условия для спасения каждого человека.

Published
2023
Full Text
View/download PDF

130. On Correspondence between Selective CPS Transformation and Selective Double Negation Translation

Author

Hyeonseung Im

Subjects
CPS transformation, double negation translation, simply typed lambda-calculus, propositional logic, Curry-Howard isomorphism, Mathematics, QA1-939
Abstract

A double negation translation (DNT) embeds classical logic into intuitionistic logic. Such translations correspond to continuation passing style (CPS) transformations in programming languages via the Curry-Howard isomorphism. A selective CPS transformation uses a type and effect system to selectively translate only nontrivial expressions possibly with computational effects into CPS functions. In this paper, we review the conventional call-by-value (CBV) CPS transformation and its corresponding DNT, and provide a logical account of a CBV selective CPS transformation by defining a selective DNT via the Curry-Howard isomorphism. By using an annotated proof system derived from the corresponding type and effect system, our selective DNT translates classical proofs into equivalent intuitionistic proofs, which are smaller than those obtained by the usual DNTs. We believe that our work can serve as a reference point for further study on the Curry-Howard isomorphism between CPS transformations and DNTs.

Published
2021
Full Text
View/download PDF

131. Measuring Inconsistency in Generalized Propositional Logic.

Author

Grant, John

Abstract

Consistency is one of the key concepts of logic; logicians have put a great deal of effort into proving the consistency of many logics. Understanding what causes inconsistency is also important; some logicians have developed paraconsistent logics that, unlike classical logics, allow some contradictions without making all formulas provable. Another direction of research studies inconsistency by measuring the amount of inconsistency of sets of formulas. While the initial attempt in 1978 was too ambitious in trying to do this for first-order logic, this research got a substantial boost when an inconsistency measure was proposed for propositional logic in 2002. Since then, researchers in logic and artificial intelligence (AI systems need the capability to deal with inconsistency) have made many interesting proposals and found related issues. Almost all of this work has been done for propositional logic. The purpose of this paper is to extend inconsistency measures to logics that also contain operators, such as modal operators. We use the terminology "generalized propositional logic" for such logics. We show how to extend propositional inconsistency measures to sets of formulas in any such generalized propositional logic. Examples are used to illustrate how various modal operators, including spatial and tense operators, fit into this framework. We also show that the addition of operators leads to a weak type of inconsistency. In all cases, the calculations for several inconsistency measures are given. [ABSTRACT FROM AUTHOR]

Published
2020
Full Text
View/download PDF

133. Talking About Graphs

Author

Gasquet, Olivier, Herzig, Andreas, Said, Bilal, Schwarzentruber, François, Béziau, Jean-Yves, Series editor, Gasquet, Olivier, Herzig, Andreas, Said, Bilal, and Schwarzentruber, François

Published
2014
Full Text
View/download PDF

144. Software for Quantifier Elimination in Propositional Logic

Author

Goldberg, Eugene, Manolios, Panagiotis, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Kobsa, Alfred, Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Nierstrasz, Oscar, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Weikum, Gerhard, Series editor, Hong, Hoon, editor, and Yap, Chee, editor

Published
2014
Full Text
View/download PDF

145. A Relatively Complete Calculus for Structured Heterogeneous Specifications

Author

Mossakowski, Till, Tarlecki, Andrzej, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, and Muscholl, Anca, editor

Published
2014
Full Text
View/download PDF

146. Polynomially Bounded Forgetting

Author

Zhou, Yi, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Kobsa, Alfred, Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Nierstrasz, Oscar, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Weikum, Gerhard, Series editor, Goebel, Randy, Series editor, Tanaka, Yuzuru, Series editor, Wahlster, Wolfgang, Series editor, Siekmann, Jörg, Series editor, Pham, Duc-Nghia, editor, and Park, Seong-Bae, editor

Published
2014
Full Text
View/download PDF

147. Cellular Automata and Formulae on Monoids

Author

Ishida, Toshikazu, Inokuchi, Shuichi, Kawahara, Yasuo, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Kobsa, Alfred, Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Nierstrasz, Oscar, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Weikum, Gerhard, Series editor, Wąs, Jarosław, editor, Sirakoulis, Georgios Ch., editor, and Bandini, Stefania, editor

Published
2014
Full Text
View/download PDF

148. Probabilistic Argumentation Frameworks – A Logical Approach

Author

Doder, Dragan, Woltran, Stefan, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Kobsa, Alfred, Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Nierstrasz, Oscar, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Weikum, Gerhard, Series editor, Goebel, Randy, Series editor, Tanaka, Yuzuru, Series editor, Wahlster, Wolfgang, Series editor, Siekmann, Jörg, Series editor, Straccia, Umberto, editor, and Calì, Andrea, editor

Published
2014
Full Text
View/download PDF

149. Adapting Propositional Cases Based on Tableaux Repairs Using Adaptation Knowledge

Author

Personeni, Gabin, Hermann, Alice, Lieber, Jean, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Kobsa, Alfred, Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Nierstrasz, Oscar, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Weikum, Gerhard, Series editor, Goebel, Randy, Series editor, Tanaka, Yuzuru, Series editor, Wahlster, Wolfgang, Series editor, Siekmann, Jörg, Series editor, Lamontagne, Luc, editor, and Plaza, Enric, editor

Published
2014
Full Text
View/download PDF

150. A Logical Descriptor for Regular Languages via Stone Duality

Author

Aguzzoli, Stefano, Diaconescu, Denisa, Flaminio, Tommaso, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Kobsa, Alfred, Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Nierstrasz, Oscar, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Weikum, Gerhard, Series editor, Ciobanu, Gabriel, editor, and Méry, Dominique, editor

Published
2014
Full Text
View/download PDF

Catalog

Books, media, physical & digital resources
See catalog results