Abstract
We describe a reasoner for OWL ontologies and SWRL policies used on cognitive radios to control dynamic spectrum access. In addition to rules and ontologies, the reasoner needs to handle user-defined operations (e.g., temporal and geospatial). Furthermore, the reasoner must perform sophisticated constraint simplification because any unresolved constraints can be used by a cognitive radio to plan and reason about its spectrum usage. No existing reasoner supported all these features. However, the term rewriting engine Maude, augmented with narrowing, provides a promising reasoning mechanism. This allows for a behavior similar to that of a logic programming system, while constraint simplification rules as well as operations can easily be defined and processed. Our system and general approach will be useful for other problems that need sophisticated constraint processing in addition to rule-based reasoning, or where new operations need to be added. The implementation is efficient enough to run on resource-constrained embedded systems such as software-defined radios.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Wilkins, D.E., Denker, G., Stehr, M.-O., Elenius, D., Senanayake, R., Talcott, C.: Policy-based cognitive radios. IEEE Wireless Communications 14(4), 41–46 (2007)
Hanus, M.: The integration of functions into logic programming: From theory to practice. J. Log. Program 19(20), 583–628 (1994)
Hanus, M.: Multi-paradigm declarative languages. In: Dahl, V., Niemelä, I. (eds.) ICLP 2007. LNCS, vol. 4670, pp. 45–75. Springer, Heidelberg (2007)
Ait-Kaci, H., Lincoln, P., Nasr, R.: Le fun: Logic, equations, and functions. In: IEEE Symposium on Logic Programming (1987)
Casas, A., Cabeza, D., Hermenegildo, M.V.: A syntactic approach to combining functional notation, lazy evaluation, and higher-order in LP systems. In: Hagiya, M., Wadler, P. (eds.) FLOPS 2006. LNCS, vol. 3945, pp. 146–162. Springer, Heidelberg (2006)
Naish, L.: Adding equations to NU-Prolog. In: Małuszyński, J., Wirsing, M. (eds.) PLILP 1991. LNCS, vol. 528, pp. 15–26. Springer, Heidelberg (1991)
Hanus, M., Kuchen, H., Moreno-Navarro, J.: Curry: A truly functional logic language. In: Proc. ILPS 1995 Workshop on Visions for the Future of Logic Programming (1995)
Clavel, M., Durán, F., Eker, S., Lincoln, P., MartÃ-Oliet, N., Meseguer, J., Talcott, C. (eds.): All About Maude - A High-Performance Logical Framework. LNCS, vol. 4350. Springer, Heidelberg (2007)
Jaffar, J., Maher, M.J.: Constraint logic programming: A survey. Journal of Logic Programming 19(20), 503–581 (1994)
Stuckey, P.J.: Negation and constraint logic programming. Information and Computation 118, 12–33 (1995)
Backer, B.D., Beringer, H.: A CLP language handling disjunctions of linear constraints. In: ICLP, pp. 550–563 (1993)
Baader, F., Nipkow, T.: Term rewriting and all that. Cambridge University Press, New York (1998)
O’Donnell, M.J.: Equational logic as a programming language. Massachusetts Institute of Technology, Cambridge, MA, USA (1985)
Meseguer, J.: Conditional rewriting logic as a unified model of concurrency. Theoretical Computer Science 96, 73–155 (1992)
Clavel, M., Meseguer, J.: Reflection and strategies in rewriting logic. In: Rewriting Logic Workshop 1996. Electronic Notes in Theoretical Computer Science, number 4. Elsevier, Amsterdam (1996), http://www.elsevier.nl/locate/entcs/volume4.html
Wirsing, M.: Algebraic specification. In: van Leeuwen, J. (ed.) Handbook of Theoretical Computer Science, vol. B, pp. 675–788. North-Holland, Amsterdam (1990)
Grosof, B.N., Horrocks, I., Volz, R., Decker, S.: Description logic programs: Combining logic programs with description logic. In: Proc. Twelfth International World Wide Web Conference (WWW 2003), pp. 48–57. ACM, New York (2003)
Knublauch, H., Fergerson, R., Noy, N., Musen, M.: The Protégé OWL plugin: An open developoment environment for Semantic Web applications. In: McIlraith, S.A., Plexousakis, D., van Harmelen, F. (eds.) ISWC 2004. LNCS, vol. 3298, pp. 229–243. Springer, Heidelberg (2004)
O’Connor, M., Das, A.: A mechanism to define and execute SWRL built-ins in Protégé-OWL (2006)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Elenius, D., Denker, G., Stehr, MO. (2008). A Semantic Web Reasoner for Rules, Equations and Constraints. In: Calvanese, D., Lausen, G. (eds) Web Reasoning and Rule Systems. RR 2008. Lecture Notes in Computer Science, vol 5341. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-88737-9_11
Download citation
DOI: https://doi.org/10.1007/978-3-540-88737-9_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-88736-2
Online ISBN: 978-3-540-88737-9
eBook Packages: Computer ScienceComputer Science (R0)