3 research outputs found
Interdefinability of defeasible logic and logic programming under the well-founded semantics
We provide a method of translating theories of Nute's defeasible logic into
logic programs, and a corresponding translation in the opposite direction.
Under certain natural restrictions, the conclusions of defeasible theories
under the ambiguity propagating defeasible logic ADL correspond to those of the
well-founded semantics for normal logic programs, and so it turns out that the
two formalisms are closely related. Using the same translation of logic
programs into defeasible theories, the semantics for the ambiguity blocking
defeasible logic NDL can be seen as indirectly providing an ambiguity blocking
semantics for logic programs. We also provide antimonotone operators for both
ADL and NDL, each based on the Gelfond-Lifschitz (GL) operator for logic
programs. For defeasible theories without defeaters or priorities on rules, the
operator for ADL corresponds to the GL operator and so can be seen as partially
capturing the consequences according to ADL. Similarly, the operator for NDL
captures the consequences according to NDL, though in this case no restrictions
on theories apply. Both operators can be used to define stable model semantics
for defeasible theories.Comment: 36 pages; To appear in Theory and Practice of Logic Programming
(TPLP
Intelligent Sensor Networks
In the last decade, wireless or wired sensor networks have attracted much attention. However, most designs target general sensor network issues including protocol stack (routing, MAC, etc.) and security issues. This book focuses on the close integration of sensing, networking, and smart signal processing via machine learning. Based on their world-class research, the authors present the fundamentals of intelligent sensor networks. They cover sensing and sampling, distributed signal processing, and intelligent signal learning. In addition, they present cutting-edge research results from leading experts