Results 91 to 100 of about 1,765 (205)

Minimization metods of normal forms of P2 systems functions [PDF]

open access: yes, 2006
Fen Bilimleri Enstitüsü, Matematik Ana Bilim DalıP2 SİSTEMİ FONKSİYONLARININ NORMAL FORMLARININMİNİMALLEŞTİRME YÖNTEMLERİÖZETP2 sistemi fonksiyonları mükemmel dizyunktif normal form ve mükemmelkonyunktif normal form gibi standart şekillerde ...
Şengül, Ebru
core  

Computing only minimal answers in disjunctive deductive databases

open access: yes, 2003
. A method is presented for computing minimal answers of the form A in disjunctive deductive databases under the disjunctive stable model semantics. Such answers are constructed by repeatedly extending partial answers.
C A Johnson
core  

The shortest disjunctive normal forms of Boolean functions by reducing the number of arguments

open access: yes, 2002
Denoting the length of a shortest disjunctive normal form of a Boolean function / by l(f), this thesis provides a way to express l(f) in terms of l(g) for some Boolean function g with no more arguments than f and with the same number of zeros as f ...
Yung, Ho Sen
core  

Abstract Feature Logic with Disjunctive Unification

open access: yes, 2008
We introduce feature terms containing sorts, variables, negation and named disjunction for the specification of feature structures. We show that the possibility to label disjunctions with names has major advantages both for the use of feature logic in ...

core  

What is the expressive power of disjunctive preconditions?

open access: yes, 1999
While there seems to be a general consensus about the expressive power of a number of language features in planning formalisms, once can find many different statements about the expressive power of disjunctive preconditions.
Nebel, B.   +1 more
core  

Teamwork Cognitive Diagnostic Modeling. [PDF]

open access: yesPsychometrika
Zhan P, Wang Z, Chu G, Qiao H.
europepmc   +1 more source

Home - About - Disclaimer - Privacy