default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDECSQARU 1995: Fribourg, Switzerland
- Christine Froidevaux, Jürg Kohlas:
Symbolic and Quantitative Approaches to Reasoning and Uncertainty, European Conference, ECSQARU'95, Fribourg, Switzerland, July 3-5, 1995, Proceedings. Lecture Notes in Computer Science 946, Springer 1995, ISBN 3-540-60112-0 - Natasha Alechina:
For All Typical. 1-8 - Matías Alvarado:
A Posteriori Knowledge: from Ambiguous Knowledge and Undefined Information to Knowledge. 9-17 - Pietro Baroni, Giovanni Guida, Silvano Mussi:
Modeling Uncertain Relational Knowledge: the AV-Quantified Production Rules Approach. 18-27 - Mario R. F. Benevides:
Multiple Database Logic. 28-36 - Salem Benferhat, Didier Dubois, Henri Prade:
A Local Approach to Reasoning under Incosistency in Stratified Knowledge Bases. 36-43 - Philippe Besnard, Anthony Hunter
:
Quasi-classical Logic: Non-trivializable classical reasoning from incosistent information. 44-51 - John Bigham, Zhiyuan Luo, Debashis Banerjee:
A Cost Bounded Possibilistic ATMS. 52-59 - Luca Boldrin:
A Substructural Connective for Possibilistic Logic. 60-68 - Remco R. Bouckaert, Milan Studený:
Chain graphs: semantics and expressiveness. 69-76 - Luis M. de Campos, Jörg Gebhardt, Rudolf Kruse:
Axiomatic Treatment of Possibilistic Independence. 77-88 - Enrique F. Castillo, José Manuel Gutiérrez, Ali S. Hadi:
Parametric Structure of Probabilities in Bayesian Networks. 89-98 - Claudette Cayrol:
From Non-Monotonic Syntax-Based Entailment to Preference-Based Argumentation. 99-106 - Claudette Cayrol, Marie-Christine Lagasquie-Schiex:
Non-monotonic Syntax-Based Entailment: A Classification of Consequence Relations. 107-114 - Alain Chateauneuf, Jean-Yves Jaffray:
Local Möbius Transforms on Monotone Capacities. 115-124 - Laurence Cholvy:
Automated Reasoning with Merged Contradictory Information Whose Reliability Depends on Topics. 125-132 - Marie-Odile Cordier, Jérôme Lang:
Linking Transition-based Update and Base Revision. 133-142 - Marie-Odile Cordier, Pierre Siegel:
Prioritized Transitions for Updates. 142-150 - Guy-Blaise Douanya Nguetsé, Pierre Hansen, Brigitte Jaumard:
Probabilistic Satisfiability and Decomposition. 151-161 - Didier Dubois, Florence Dupin de Saint-Cyr, Henri Prade:
Update Postulates without Inertia. 162-170 - Didier Dubois, Francesc Esteva, Pere Garcia, Lluís Godo, Henri Prade:
Similarity-based Consequence Relations. 171-180 - Barbara Dunin-Keplicz, Anna Radzikowska:
Epistemic Approach to Actions with Typical Effects. 180-188 - Joeri Engelfriet, Heinrich Herre, Jan Treur:
Nonmonotonic Belief State Frames and Reasoning Frames (extended abstract). 189-196 - Kazuo J. Ezawa, Til Schuermann:
A Bayesian Network Based Learning System: Architecture and Performance Comparison with Other Models. 197-206 - P. Geerts, Dirk Vermeir:
Specificity by Default. 207-216 - Sabine Glesner, Daphne Koller:
Constructing Flexible Dynamic Belief Networks from First-Order Probalistic Knowledge Bases. 217-226 - Silviu Guiasu:
On the Formalism of Stochastic Logic. 227-234 - Anthony Hunter:
Using Default Logic in Information Retrieval. 235-242 - Finn Verner Jensen, Søren H. Aldenryd, Klaus B. Jensen:
Sensitivity Analysis in Bayesian Networks. 243-250 - A. V. Joshi, S. C. Sahasrabudhe, K. Shankar:
Bayesian Approximation and Invariance of Bayesian Belief Functions. 251-258 - Jürg Kohlas, Paul-André Monney, Rolf Haenni, Norbert Lehmann:
Model-Based Diagnostics Using Hints. 259-266 - Ivan Kramosil:
An Axiomatic Approach to Extensional Probability Measures. 267-276 - Bernd van Linder, Wiebe van der Hoek, John-Jules Ch. Meyer:
The Dynamics of Default Reasoning (Extended Abstract). 277-284 - Thomas Linke, Torsten Schaub:
Lemma Handling in Default Logic Theorem Provers. 285-292 - Thomas Lukasiewicz:
Uncertain Reasoning in Concept Lattices. 293-300 - Jérôme Mengin:
A Theorem Prover for Default Logic Based on Prioritized Conflict Resolution and an Extended Resolution Principle. 301-310 - Pascal Nicolas, Béatrice Duval:
A Theorem Prover for Lukaszewicz' Open Default Theory. 311-319 - Ulrich G. Oppel:
Two Different Types of Discontinuity of Bayesian Learning in Causal Probabilistic Networks. 320-327 - Odile Papini, Antoine Rauzy:
Revision in Extended Propositional Calculus. 328-335 - Simon Parsons:
Using Qualitative Uncertainty in Protein Topology Prediction. 336-343 - Anna Radzikowska:
Circumscribing Features and Fluents: Reasoning about Action with Default Effects. 344-351 - Paul C. Rhodes, Gerald R. Garside:
Using Maximum Entropy to Compute Marginal Probabilities in a Causal Binary Tree Need not Take Exponential Time. 352-363 - Vincent Risch:
Yet Some More Considerations On Cumulativity In Default Logics. 364-378 - Karl Schlechta:
A Two-Stage Approach to First Order Default Reasoning. 379-386 - Karl Schlechta:
A Reduction of the Theory of Confirmation to the Notions of Distance and Measure. 387-394 - Johan Schubert:
Cluster-based Specification Techniques in Dempster-Shafer Theory. 395-404 - Luminita State, Radu State:
And/Or Trees for Knowledge Representation. 405-411 - Yao-Hua Tan, Leendert W. N. van der Torre:
Why Defeasible Deontic Logic needs a Multi Preference Semantics. 412-419 - Emil Weydert:
Numeric Defaults. 420-427
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-06-21 00:35 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
