scientific article; zbMATH DE number 1285158

From MaRDI portal
Publication:4242057

zbMath0914.68178MaRDI QIDQ4242057

Thomas Lukasiewicz

Publication date: 10 May 1999


Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.



Related Items (23)

Probabilistic logic under coherence: complexity and algorithmsRobust reasoning with rules that have exceptions: From second-order probability to argumentation via upper envelopes of probability and possibility plus directed graphsCoherence graphsGraphical models for imprecise probabilitiesExpressive probabilistic description logicsNonmonotonic probabilistic logics under variable-strength inheritance with overriding: complexity, algorithms, and implementationUncertain lightweight ontologies in a product-based possibility theory frameworkOn the Complexity of Probabilistic Abstract Argumentation FrameworksSyntactic reasoning with conditional probabilities in deductive argumentationMeasuring inconsistency in probabilistic logic: rationality postulates and Dutch book interpretationOn efficiently estimating the probability of extensions in abstract argumentation frameworksGeneralizing inference rules in a coherence-based probabilistic default reasoningConsistency checking and querying in probabilistic databases under integrity constraintsWeak nonmonotonic probabilistic logicsA Survey of First-Order Probabilistic ModelsAn anytime deduction algorithm for the probabilistic logic and entailment problemsMerging the local and global approaches to probabilistic satisfiabilitySpecial issue: Soft computing in recognition and searchA methodology for computing with wordsNew Advances in Logic-Based Probabilistic Modeling by PRISMApproximate well-founded semantics, query answering and generalized normal logic programs over latticesProbabilistic Reasoning in the Description Logic $$\mathcal {ALCP}$$ with the Principle of Maximum EntropyCombining probabilistic logic programming with the power of maximum entropy






This page was built for publication: