Pages that link to "Item:Q3549126"

The following pages link to Probabilistic logic programming with conditional constraints (Q3549126):

Displaying 50 items.

• Focused most probable world computations in probabilistic logic programs (Q454145) (← links)
• Imprecise probabilistic query answering using measures of ignorance and degree of satisfaction (Q454147) (← links)
• Negative probabilities in probabilistic logic programs (Q518605) (← links)
• On the complexity of propositional and relational credal networks (Q518627) (← links)
• Logic programming, abduction and probability. A top-down anytime algorithm for estimating prior and posterior probabilities (Q688819) (← links)
• A top-\(k\) query answering procedure for fuzzy logic programming (Q695268) (← links)
• Probabilistic logic under coherence: complexity and algorithms (Q819942) (← links)
• Computational complexity of queries based on itemsets (Q844194) (← links)
• Nonmonotonic probabilistic logics under variable-strength inheritance with overriding: complexity, algorithms, and implementation (Q881802) (← links)
• Probabilistic (logic) programming concepts (Q894692) (← links)
• A new probabilistic constraint logic programming language based on a generalised distribution semantics (Q896427) (← links)
• On efficiently estimating the probability of extensions in abstract argumentation frameworks (Q899472) (← links)
• Editorial. Probabilistic logic programming (PLP'14) (Q900365) (← links)
• An OpenCL implementation of a forward sampling algorithm for CP-logic (Q900368) (← links)
• A concept for the evolution of relational probabilistic belief states and the computation of their changes under optimum entropy semantics (Q901077) (← links)
• An anytime deduction algorithm for the probabilistic logic and entailment problems (Q962834) (← links)
• Probabilistic description logic programs (Q997050) (← links)
• Approximate well-founded semantics, query answering and generalized normal logic programs over lattices (Q1039575) (← links)
• The theory of interval probabilistic logic programs (Q1039578) (← links)
• Probabilistic logic programming (Q1207942) (← links)
• A semantical framework for supporting subjective and conditional probabilities in deductive databases (Q1311410) (← links)
• Interval-valued probabilistic logic for a class of Horn clauses (Q1388210) (← links)
• A deductive probabilistic and fuzzy object-oriented database language. (Q1414782) (← links)
• Complexity results for structure-based causality. (Q1852862) (← links)
• The joy of probabilistic answer set programming: semantics, complexity, expressivity, inference (Q2206456) (← links)
• Conditional probability logic, lifted Bayesian networks, and almost sure quantifier elimination (Q2215958) (← links)
• Complexity results for probabilistic answer set programming (Q2302961) (← links)
• Theory and algorithms for analysing the consistent region in probabilistic logic (Q2365922) (← links)
• Termination of logic programs with imperfect information: applications and query procedure (Q2372195) (← links)
• Probabilistic logic with independence (Q2379311) (← links)
• Probabilistic description logic programs under inheritance with overriding for the semantic Web (Q2379312) (← links)
• Expressive probabilistic description logics (Q2389639) (← links)
• Assembling a consistent set of sentences in relational probabilistic logic with stochastic independence (Q2390651) (← links)
• The complexity of inferences and explanations in probabilistic logic programming (Q2401894) (← links)
• Inconsistency-tolerant reasoning over linear probabilistic knowledge bases (Q2411265) (← links)
• Consistency checking and querying in probabilistic databases under integrity constraints (Q2453564) (← links)
• Weak nonmonotonic probabilistic logics (Q2457653) (← links)
• The complexity of satisfying constraints on databases of transactions (Q2464038) (← links)
• Itemset frequency satisfiability: complexity and axiomatization (Q2481978) (← links)
• Safe projections of binary data sets (Q2491217) (← links)
• Nonmonotonic probabilistic reasoning under variable-strength inheritance with overriding (Q2576433) (← links)
• Parallel Abductive Query Answering in Probabilistic Logic Programs (Q2946697) (← links)
• On the Complexity of Probabilistic Abstract Argumentation Frameworks (Q2946762) (← links)
• The PITA system: Tabling and answer subsumption for reasoning under uncertainty (Q3087434) (← links)
• Beyond multi-adjoint logic programming (Q3451409) (← links)
• Probabilistic logic under coherence, model-theoretic probabilistic logic, and default reasoning in System<i>P</i> (Q4453901) (← links)
• Constraint-Based Inference in Probabilistic Logic Programs (Q4559821) (← links)
• Logic Programming (Q5313179) (← links)
• Advances in Computer Science - ASIAN 2004. Higher-Level Decision Making (Q5463961) (← links)
• Syntactic reasoning with conditional probabilities in deductive argumentation (Q6108761) (← links)