Sciweavers

177 search results - page 9 / 36
» Extending Conceptual Logic Programs with Arbitrary Rules
Sort
View
SEMWEB
2005
Springer
14 years 1 months ago
Preferential Reasoning on a Web of Trust
Abstract. We introduce a framework, based on logic programming, for preferential reasoning with agents on the Semantic Web. Initially, we encode the knowledge of an agent as a logi...
Stijn Heymans, Davy Van Nieuwenborgh, Dirk Vermeir
POPL
2012
ACM
12 years 3 months ago
Syntactic control of interference for separation logic
Separation Logic has witnessed tremendous success in recent years in reasoning about programs that deal with heap storage. Its success owes to the fundamental principle that one s...
Uday S. Reddy, John C. Reynolds
KI
2007
Springer
14 years 1 months ago
Proposal of Generalized Rule Programming Model
Abstract. Rule-based programming paradigm is omnipresent in number of engineering domains. However, there are some fundamental semantical differences between it, and classic progr...
Grzegorz J. Nalepa, Igor Wojnicki
ICDT
1995
ACM
91views Database» more  ICDT 1995»
13 years 11 months ago
Some Positive Results for Boundedness of Multiple Recursive Rules
Following results are sketched in this extended abstract: (1) Datalog recursive programs where each rule has at most one subgoal called unit recursions are shown to be bounded, wit...
Ke Wang
CORR
2010
Springer
165views Education» more  CORR 2010»
13 years 7 months ago
Cut-Elimination and Proof Search for Bi-Intuitionistic Tense Logic
We consider an extension of bi-intuitionistic logic with the traditional modalities , , and from tense logic Kt. Proof theoretically, this extension is obtained simply by extendin...
Rajeev Goré, Linda Postniece, Alwen Tiu