Results 21 to 30 of about 510,140 (296)
An elementary, but fundamental, operation in disjunctive programming is a basic step, which is the intersection of two disjunctions to form a new disjunction.
DimitriJ. Papageorgiou +1 more
doaj +1 more source
Disjunctive Normal Form for Multi-Agent Modal Logics Based on Logical Separability
Modal logics are primary formalisms for multi-agent systems but major reasoning tasks in such logics are intractable, which impedes applications of multi-agent modal logics such as automatic planning.
Liangda Fang +3 more
semanticscholar +1 more source
Quality measures for fuzzy predicates in conjunctive and disjunctive normal forms
Association rule mining is a very popular data mining technique. Rules in this technique are often used to identify and represent de-pendencies between attributes in databases.
Taymi Ceruto Cordovés +2 more
doaj +1 more source
Unsupervised DNF Blocking for Efficient Linking of Knowledge Graphs and Tables
Entity Resolution (ER) is the problem of identifying co-referent entity pairs across datasets, including knowledge graphs (KGs). ER is an important prerequisite in many applied KG search and analytics pipelines, with a typical workflow comprising two ...
Mayank Kejriwal
doaj +1 more source
Context-Aware Explainable Recommendation Based on Domain Knowledge Graph
With the rapid growth of internet data, knowledge graphs (KGs) are considered as efficient form of knowledge representation that captures the semantics of web objects.
Muzamil Hussain Syed +2 more
doaj +1 more source
Information modeling of the normal forms of logical functions in Maple system [PDF]
The article discusses possible ways to use the Maple computer algebra system to obtain perfect conjunctive and disjunctive normal forms. Computer algebra systems make it possible to expand the possibilities for creating, applying and using mathematical ...
Olenev Aleksandr +3 more
doaj +1 more source
Converting ALC Connection Proofs into ALC Sequents [PDF]
The connection method has earned good reputation in the area of automated theorem proving, due to its simplicity, efficiency and rational use of memory. This method has been applied recently in automatic provers that reason over ontologies written in the
Eunice Palmeira +2 more
doaj +1 more source
An Empirical Investigation Into Deep and Shallow Rule Learning
Inductive rule learning is arguably among the most traditional paradigms in machine learning. Although we have seen considerable progress over the years in learning rule-based theories, all state-of-the-art learners still learn descriptions that directly
Florian Beck, Johannes Fürnkranz
doaj +1 more source
Backdoors to Normality for Disjunctive Logic Programs [PDF]
Over the last two decades, propositional satisfiability (SAT) has become one of the most successful and widely applied techniques for the solution of NP-complete problems.
Fichte, Johannes Klaus, Szeider, Stefan
core +1 more source
Disjunctive Normal Form of Weak Classifiers for Online Learning based Object Tracking
The use of a strong classifier that is combined by an ensemble of weak classifiers has been prevalent in tracking, classification etc. In the conventional ensemble tracking, one weak classifier selects a 1D feature, and the strong classifier is combined ...
Zhu Teng, D. Kang
semanticscholar +1 more source

