Sciweavers

3693 search results - page 10 / 739
» Splitting a Logic Program
Sort
View
JAPLL
2008
101views more  JAPLL 2008»
13 years 7 months ago
Circle graphs and monadic second-order logic
A circle graph is the intersection graph of a set of chords of a circle. If a circle graph is prime for the split (or join) decomposition defined by Cunnigham, it has a unique rep...
Bruno Courcelle
AMAI
2006
Springer
13 years 8 months ago
A split-combination approach to merging knowledge bases in possibilistic logic
In this paper, we propose an adaptive approach to merging possibilistic knowledge bases that deploys multiple operators instead of a single operator in the merging process. The me...
Guilin Qi, Weiru Liu, David H. Glass, David A. Bel...
SAINT
2009
IEEE
14 years 2 months ago
CCDM: Central Controller-Based Device Management Architecture and Method to Split Management Scripts
This paper presents CCDM, a new architecture for management of devices, which collect environmental information and give effects to the environment. CCDM provides easy management ...
Akihiro Sugiyama, Hideya Ochiai, Hiroshi Esaki
CADE
2007
Springer
14 years 8 months ago
Logical Interpretation: Static Program Analysis Using Theorem Proving
Abstract. This paper presents the foundations for using automated deduction technology in static program analysis. The central principle is the use of logical lattices ? a class of...
Ashish Tiwari, Sumit Gulwani
CADE
2002
Springer
14 years 8 months ago
A New Clausal Class Decidable by Hyperresolution
In this paper we define a new clausal class, called BU, which can be decided by hyperresolution with splitting. We also consider the model generation problem for BU and show that h...
Lilia Georgieva, Ullrich Hustadt, Renate A. Schmid...