Results 71 to 80 of about 1,765 (205)

What is the Expressive Power of Disjunctive Preconditions?

, 2000
. While there seems to be a general consensus about the expressive power of a number of language features in planning formalisms, one can nd many dierent statements about the expressive power of disjunctive preconditions.
Bernhard Nebel
core   +1 more source

A heuristic method for multi-block parallel decomposition of a system of partial Boolean functions

Informatika, 2018
A heuristic method for multi-block parallel decomposition of a system of partial Boolean functions is described. The method minimizes the number of functions forming the required superposition.
Yu. V. Pottosin
doaj  

Practically Useful Variants of Definitional Translations to Normal Form

, 2000
In this paper, we compare different normal form translations from a practical point of view. The usual translation of a closed first-order formula to a disjunctive normal form has severe drawbacks, namely the disruption of the formula's structure and an ...
Egly, Uwe, Rath, Thomas
core   +1 more source

Disjunctive and conjunctive decompositions of incompletely defined Boolean functions in a Binary Decision Diagram

Informatika
Objectives. The problems of minimizing the number of cofactors (subfunctions) of the Shannon expansions located at the same level of the BDD, representing a system of incompletely defined (partial) Boolean functions, are considered.
P. N. Bibilo
doaj   +1 more source

AIisTRAcr AN EXTENDED DISJUNCTIVE NORMAL FORM APPROACH FOR OPTIMIZING RECURSIVE LOGIC QUERIES IN LOOSELY COUPLED ENVIRONMENTS

, 2008
We present an approach to processing logic queries in loosely coupled environments. We emphasize the importance of the loose coupling technique as a practkal solution to provide deductive capabiities to existing DBMS+especially when an efficient access ...

core  

DECODING OF STRUCTURALLY AND LOGICAL CODES

Системный анализ и прикладная информатика, 2016
The article deals with the description of the main points of the structural and logical coding and the features of SLC codes. There are shown the basic points of the generalized algorithm of decoding SLC, which is based on the method of perfect matrix ...
Yu. D. Ivanov, I. N. Nikolov, B. V. Lozka   +2 more
doaj  

INTEGRATION OF EXPERT SYSTEMS AND DATABASE-MANAGEMENT SYSTEMS - AN EXTENDED DISJUNCTIVE NORMAL-FORM APPROACH

, 1992
We present a technique for integrating expert systems and database management systems (DBMSs). Such integration is essential to accommodate new expert system applications that require a large volume of factual information that cannot be stored in main ...
NAVATHE, SB, Whang, Kyu-Young
core  

Efficient dualization of (n)-term monotone disjunctive normal forms

Discrete Applied Mathematics, 2003
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +1 more source

On the Learnability of Disjunctive Normal Form Formulas and Decision Trees

, 1993
The learnability of disjunctive normal form formulas and decision trees is investigated. Polynomial time algorithms are given, and nonlearnability results are obtained, for restricted versions of these general learning problems.Polynomial time algorithms
Aizenstein, Howard Jay
core  

A method for bi-decomposition of partial Boolean functions

Informatika, 2019
The problem of bi-decomposition of a Boolean function is to represent a given Boolean function in the form of a given logic algebra operation over two Boolean functions and so is reduced to specification of these functions.
Yu. V. Pottosin
doaj