Abstract
This paper introduces the use of Description Logic as a programming language, giving: a logic with appropriate concept constructors and sentential forms; some example programs; requirements for the results of program execution; a tableau algorithm that provably produces the desired results; principles for discarding sentences once no longer needed so that algorithms that take more time than space can be implemented; a worked example of program execution; and a discussion of outstanding theoretical challenges.
Supplementary Material
N/A
- Download
- 124.61 KB
References
[1]
F. Baader. A. description logic terminology. In F. Baader, D. Calvanese, D. L. McGuinness, D. Nardi, and P. F. Patel-Schneider, editors, The Description Logic Handbook, pages 525--536. Cambridge, second edition, 2007.
[2]
F. Baader and U. Sattler. An overview of tableau algorithms for description logics. Studia Logica, 69(1):5--40, 2001.
[3]
T. Eiter, G. Ianni, T. Lukasiewicz, and R. Schindlauer. Well-founded semantics for description logic programs in the semantic web. ACM Transactions on Computational Logic (TOCL), 12(2):1--41, Jan. 2011.
[4]
D. Frankel. Model Driven Architecture - Applying MDA to Enterprise Computing. OMG Press. Wiley Publishing, Inc., 2003.
[5]
E. R. Gansner and S. C. North. An open graph visualization system and its applications to software engineering. Software - Practice and Experience, 30 (11):1203--1233, 2000.
[6]
B. N. Grosof, I. Horrocks, R. Volz, and S. Decker. Description logic programs: Combining logic programs with description logic. In Proceedings of the 12th International Conference on World Wide Web, WWW '03, pages 48--57. ACM, 2003.
[7]
D. Jackson. Software Abstractions: Logic, Language, and Analysis. The MIT Press, 2006.
[8]
D. E. Knuth. The Art of Computer Programming, Volume 1 (3rd Ed.): Fundamental Algorithms. Addison Wesley, 1997.
[9]
R. Kowalski. Predicate logic as programming language. Information Processing Letters, 74:569--574, 1974.
[10]
A. Milicevic, D. Rayside, K. Yessenov, and D. Jackson. Unifying execution of imperative and declarative code. In Proceedings of the 33rd International Conference on Software Engineering, ICSE '11, pages 511--520. ACM, 2011.
[11]
D. Nardi and R. J. Brachman. An introduction to description logics. In F. Baader, D. Calvanese, D. L. McGuinness, D. Nardi, and P. F. Patel-Schneider, editors, The Description Logic Handbook, pages 1--44. Cambridge, second edition, 2007.
[12]
Object Constraint Language - OMG Available Specification - Version 2.0. The Object Management Group (OMG), formal/2006-05-01 edition, May 2005.
[13]
OMG Unified Modeling Language (OMG UML), Super-structure - Version 2.4.1. The Object Management Group (OMG), formal/2011-08-06 edition, 2011.
[14]
A. J. Perlis. Epigrams on programming. SIGPLAN Notices, 17(9):7--13, 1982.
[15]
E. Torlak. A Constraint Solver for Software Engineering: Finding Models and Cores of Large Relational Specifications. PhD thesis, Massachusetts Institute of Technology, 2009.
[16]
P. van Emde Boas. Machine models and simulation. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity (A), pages 1--66. Elsevier, 1990.
Index Terms
- Description Logic as Programming Language
Recommendations
Undecidability of the unification and admissibility problems for modal and description logics
We show that the unification problem “is there a substitution instance of a given formula that is provable in a given logic?” is undecidable for basic modal logics K and K4 extended with the universal modality. It follows that the admissibility problem ...
Coalition Description Logic with Individuals
Coalitional Description Logic [Seylan, I. and W. Jamroga, Description logic for coalitions, in: Proceedings of AAMAS'09, 2009, pp. 425-432.] is a product style combination of Coalition Logic and the description logic ALC. It enables reasoning about ...
Probabilistic description logic programs
Towards sophisticated representation and reasoning techniques that allow for probabilistic uncertainty in the Rules, Logic, and Proof layers of the Semantic Web, we present probabilistic description logic programs (or pdl-programs), which are a ...
Comments
Please enable JavaScript to view thecomments powered by Disqus.Information & Contributors
Information
Published In
October 2014
332 pages
ISBN:9781450332101
DOI:10.1145/2661136
- General Chair:
- Andrew Black,
- Program Chairs:
- Shriram Krishnamurthi,
- Bernd Bruegge,
- Publications Chair:
- Joseph N. Ruskiewicz
Copyright © 2014 ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]
Sponsors
In-Cooperation
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 14 October 2014
Check for updates
Author Tags
Qualifiers
- Research-article
Funding Sources
- New Zealand Foundation for Research Science and Technology
Conference
SPLASH '14
Sponsor:
SPLASH '14: Conference on Systems, Programming, and Applications: Software for Humanity
October 20 - 24, 2014
Oregon, Portland, USA
Acceptance Rates
Onward! 2014 Paper Acceptance Rate 16 of 35 submissions, 46%;
Overall Acceptance Rate 40 of 105 submissions, 38%
Upcoming Conference
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 206Total Downloads
- Downloads (Last 12 months)5
- Downloads (Last 6 weeks)1
Reflects downloads up to 19 Nov 2024
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in