2035 search results - page 192 / 407 » On the complexity of stratified logics |
187
click to vote
ICCS
2009
Springer
16 years 1 months ago
2009
Springer
We present a modular approach to realizing fine-grained adaptation of program behavior in a parallel environment. Using a compositional framework based on function call intercepti...
168
click to vote
AGP
2003
IEEE
15 years 11 months ago
2003
IEEE
In ordered logic programs, i.e. partially ordered sets of clauses where smaller rules carry more preference, inconsistencies, which appear as conflicts between applicable rules, a...
179
click to vote
ISMVL
2000
IEEE
15 years 11 months ago
2000
IEEE
Signed conjunctive normal form (signed CNF) is a classical conjunctive clause form using a generalized notion of literal, called signed atom. A signed atom is an expression of the...
144
click to vote
DAGSTUHL
2006
15 years 7 months ago
2006
This paper presents the optimal compression for sequences with undefined values. Let we have (N -m) undefined and m defined positions in the boolean sequence V of length N. The se...
185
click to vote
DAGSTUHL
1998
15 years 7 months ago
1998
Abstract. During the last years, a number of formal specification languages for knowledge-based systems have been developed. Characteristic for knowledge-based systems are a comple...