Equational logic as a programming language
Equational logic as a programming language
Handbook of theoretical computer science (vol. B)
Conditional rewriting logic as a unified model of concurrency
Selected papers of the Second Workshop on Concurrency and compositionality
A CLP language handling disjunctions of linear constraints
ICLP'93 Proceedings of the tenth international conference on logic programming on Logic programming
Negation and constraint logic programming
Information and Computation
Term rewriting and all that
Description logic programs: combining logic programs with description logic
WWW '03 Proceedings of the 12th international conference on World Wide Web
Multi-paradigm declarative languages
ICLP'07 Proceedings of the 23rd international conference on Logic programming
All about maude - a high-performance logical framework: how to specify, program and verify systems in rewriting logic
FLOPS'06 Proceedings of the 8th international conference on Functional and Logic Programming
IEEE Wireless Communications
Toward distributed declarative control of networked cyber-physical systems
UIC'10 Proceedings of the 7th international conference on Ubiquitous intelligence and computing
A distributed logic for networked cyber-physical systems
FSEN'11 Proceedings of the 4th IPM international conference on Fundamentals of Software Engineering
Hi-index | 0.00 |
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.