On improving the scalability of checking satisfiability in probabilistic description logics

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5785 LNAI, Issue , 2009, Pages 138-149

  Klinov, Pavel ^a   Parsia, Bijan ^a  

^a UNIVERSITY OF MANCHESTER   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

COLUMN GENERATION; COLUMN GENERATION APPROACH; CONSTRAINED SHORTEST PATH; CUTTING STOCK; LINEAR OPTIMIZATION; OPTIMIZATION PROBLEMS; OPTIMIZATION TECHNIQUES; PROBABILISTIC DESCRIPTIONS; REASONING PROBLEMS; SATISFIABILITY; SATISFIABILITY PROBLEMS;

DATA DESCRIPTION; LINEAR SYSTEMS; PROBABILISTIC LOGICS; SCALABILITY;

CONSTRAINED OPTIMIZATION;

EID: 70350449422     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-04388-8_12     Document Type: Conference Paper

References (14)

1. Klinov, P., Parsia, B.: Optimization and evaluation of reasoning in probabilistic description logic: Towards a systematic approach. In: International Semantic Web Conference, pp. 213-228 (2008)
2. Klinov, P., Parsia, B.: Probabilistic modeling and OWL: A user oriented introduction into P-SHIQ(D). In: OWL: Experiences and Directions (2008)
3. Giugno, R., Lukasiewicz, T.: P-SHOQ(D): A probabilistic extension of SHOQ(D) for probabilistic ontologies in the semantic web. Technical Report Nr. 1843-02-06, Institut fur Informationssysteme, Technische Universitat Wien (2002)
4. Lukasiewicz, T.: Expressive probabilistic description logics. Artificial Intelligence 172(6-7), 852-883 (2008)
5. Horrocks, I., Sattler, U., Tobies, S.: Practical reasoning for very expressive description logics. Journal of the IGPL 8(3) (2000)
6. Lukasiewicz, T.: Probabilistic logic programming with conditional constraints. ACM Transactions on Computational Logic 2(3), 289-339 (2001)
7. Gilmore, P.C., Gomory, R.E.: A linear programming approach to the cutting stock problem. Operations Research 9, 849-859 (1961)
8. Horridge, M., Parsia, B., Sattler, U.: Laconic and precise justifications in OWL. In: International Semantic Web Conference, pp. 323-338 (2008)
9. Verfaillie, G., Lematre, M., Schiex, T.: Russian doll search for solving constraint optimization problems. In: Advances in Artificial Intelligence Conference, pp. 181-187 (1996)
10. Lukasiewicz, T.: Probabilistic deduction with conditional constraints over basic events. Journal of Artificial Intelligence Research 10, 199-241 (1999)
11. Lukasiewicz, T.: Local probabilistic deduction from taxonomic and probabilistic knowledge-bases over conjunctive events. International Journal of Approximate Reasoning 21(1), 23-61 (1999)
12. Lukasiewicz, T.: Efficient global probabilistic deduction from taxonomic and probabilistic knowledge-bases over conjunctive events. In: 6th International Conference on Information and Knowledge Management, pp. 75-82. ACM Press, New York (1997)
13. Kavvadias, D.J., Papadimitriou, C.H.: A linear programming approach to reasoning about probabilities. Annals of Mathematics and Artificial Intelligence 1, 189-205 (1990)
14. Jaumard, B., Hansen, P., Aragão, M.P.d.: Column generation methods for probabilistic logic. In: Integer Programming and Combinatorial Optimization Conference, pp. 313-331 (1990)