Sciweavers

3032 search results - page 489 / 607
» Description Logic Rules
Sort
View
AMAI
2006
Springer
13 years 10 months ago
A generalization of the Lin-Zhao theorem
The theorem on loop formulas due to Fangzhen Lin and Yuting Zhao shows how to turn a logic program into a propositional formula that describes the program's stable models. In...
Paolo Ferraris, Joohyung Lee, Vladimir Lifschitz
FUIN
2008
93views more  FUIN 2008»
13 years 10 months ago
Logic-based Conflict Detection for Distributed Policies
Policies are used to describe rules that are employed to modify (often distributed) system behaviour at runtime. Typically policies are created by many different people and there a...
Carlo Montangero, Stephan Reiff-Marganiec, Laura S...
PERCOM
2008
ACM
13 years 10 months ago
Peer-to-Peer Context Reasoning in Pervasive Computing Environments
In this paper, we propose a peer-to-peer approach to derive and obtain additional context data from lowlevel context data that may be spread over multiple domains in pervasive com...
Tao Gu, Hung Keng Pung, Daqing Zhang
ENTCS
2000
80views more  ENTCS 2000»
13 years 10 months ago
Behavioral and Coinductive Rewriting
Behavioral rewriting di ers from standard rewriting in taking account of the weaker inference rules of behavioral logic, but it shares much with standard rewriting, including noti...
Joseph A. Goguen, Kai Lin, Grigore Rosu
CORR
2008
Springer
148views Education» more  CORR 2008»
13 years 9 months ago
Efficiently Simulating Higher-Order Arithmetic by a First-Order Theory Modulo
In deduction modulo, a theory is not represented by a set of axioms but by a congruence on propositions modulo which the inference rules of standard deductive systems--such as for ...
Guillaume Burel