The following pages link to Thomas Lukasiewicz (Q429434):
Displayed 50 items.
- Tightly integrated probabilistic description logic programs for representing ontology mappings (Q429437) (← links)
- Complexity results for explanations in the structural-model approach (Q814579) (← links)
- Combining probabilistic logic programming with the power of maximum entropy (Q814608) (← links)
- Probabilistic logic under coherence: complexity and algorithms (Q819942) (← links)
- Nonmonotonic probabilistic logics under variable-strength inheritance with overriding: complexity, algorithms, and implementation (Q881802) (← links)
- Description logic programs under probabilistic uncertainty and fuzzy vagueness (Q962902) (← links)
- Probabilistic description logic programs (Q997050) (← links)
- Item:Q429434 (redirect page) (← links)
- Default reasoning from conditional knowledge bases: Complexity and tractable cases (Q1589638) (← links)
- Probabilistic default reasoning with conditional constraints (Q1601882) (← links)
- Ontological query answering under many-valued group preferences in Datalog\(+/-\) (Q1726403) (← links)
- Local probabilistic deduction from taxonomic and probabilistic knowledge-bases over conjunctive events (Q1807597) (← links)
- Complexity results for structure-based causality. (Q1852862) (← links)
- Ontology-based semantic search on the web and its combination with the power of inductive reasoning (Q1928818) (← links)
- Inconsistency-tolerant query answering for existential rules (Q2124462) (← links)
- Query answering under probabilistic uncertainty in Datalog\(+/-\) ontologies (Q2248518) (← links)
- Partially observable game-theoretic agent programming in Golog (Q2300459) (← links)
- Complexity results for preference aggregation over (\(m\))CP-nets: Pareto and majority voting (Q2321294) (← links)
- A data model and algebra for probabilistic complex values (Q2349820) (← links)
- Probabilistic description logic programs under inheritance with overriding for the semantic Web (Q2379312) (← links)
- Expressive probabilistic description logics (Q2389639) (← links)
- Combining answer set programming with description logics for the semantic web (Q2389666) (← links)
- A novel characterization of the complexity class \(\Theta_k^{\mathrm{P}}\) based on counting and comparison (Q2404077) (← links)
- Causes and explanations in the structural-model approach: Tractable cases (Q2457624) (← links)
- Weak nonmonotonic probabilistic logics (Q2457653) (← links)
- Nonmonotonic probabilistic reasoning under variable-strength inheritance with overriding (Q2576433) (← links)
- Complexity results for preference aggregation over \((m)\)CP-nets: max and rank voting (Q2667819) (← links)
- Rationalizing predictions by adversarial information calibration (Q2680803) (← links)
- Well-founded semantics for description logic programs in the semantic web (Q2946628) (← links)
- Ontology Reasoning with Deep Neural Networks (Q3300669) (← links)
- (Q3455581) (← links)
- Probabilistic object bases (Q3507287) (← links)
- Description Logic Programs Under Probabilistic Uncertainty and Fuzzy Vagueness (Q3524929) (← links)
- Probabilistic logic programming with conditional constraints (Q3549126) (← links)
- Probabilistic Lexicographic Entailment under Variable-Strength Inheritance with Overriding (Q3550871) (← links)
- Tightly Coupled Probabilistic Description Logic Programs for the Semantic Web (Q3638227) (← links)
- (Q4242057) (← links)
- (Q4263812) (← links)
- (Q4380999) (← links)
- Probabilistic logic under coherence, model-theoretic probabilistic logic, and default reasoning in System<i>P</i> (Q4453901) (← links)
- (Q4504006) (← links)
- (Q4536334) (← links)
- Complexity of Threshold Query Answering in Probabilistic Ontological Data Exchange (Q4576232) (← links)
- Complexity Results for Probabilistic Datalog (Q4576254) (← links)
- (Q4708909) (← links)
- (Q4784844) (← links)
- (Q4798019) (← links)
- (Q4955341) (← links)
- (Q4999267) (← links)
- Multi-Label Classification Neural Networks with Hard Logical Constraints (Q5026213) (← links)