Sciweavers

2308 search results - page 278 / 462
» Representing Symbolic Reasoning
Sort
View
FSS
2010
102views more  FSS 2010»
15 years 3 months ago
Measuring conflict and agreement between two prioritized knowledge bases in possibilistic logic
In this paper we investigate the relationship between two prioritized knowledge bases by measuring both the conflict and the agreement between them. First of all, a quantity of co...
Guilin Qi, Weiru Liu, David A. Bell
CORR
2011
Springer
186views Education» more  CORR 2011»
15 years 1 months ago
A Goal-Directed Implementation of Query Answering for Hybrid MKNF Knowledge Bases
Ontologies and rules are usually loosely coupled in knowledge representation formalisms. In fact, ontologies use open-world reasoning while the leading semantics for rules use non...
Ana Sofia Gomes, José Júlio Alferes,...
CORR
2011
Springer
187views Education» more  CORR 2011»
14 years 10 months ago
Backdoors to Tractable Answer-Set Programming
We present a unifying approach to the efficient evaluation of propositional answer-set programs. Our approach is based on backdoors which are small sets of atoms that represent ...
Johannes Klaus Fichte, Stefan Szeider
POPL
2008
ACM
16 years 6 months ago
Cyclic proofs of program termination in separation logic
We propose a novel approach to proving the termination of heapmanipulating programs, which combines separation logic with cyclic proof within a Hoare-style proof system. Judgement...
James Brotherston, Richard Bornat, Cristiano Calca...
POPL
2008
ACM
16 years 6 months ago
Relational inductive shape analysis
alyses are concerned with precise abstractions of the heap to capture detailed structural properties. To do so, they need to build and decompose summaries of disjoint memory regio...
Bor-Yuh Evan Chang, Xavier Rival