Sciweavers

2018 search results - page 47 / 404
» Code Normal Forms
Sort
View
FROCOS
2007
Springer
15 years 6 months ago
Temporal Logic with Capacity Constraints
Often when formalising dynamic systems, constraints such as exactly “n” of a set of values hold. In this paper, we consider reasoning about propositional linear time temporal ...
Clare Dixon, Michael Fisher, Boris Konev
KI
2007
Springer
15 years 6 months ago
Knowledge Compilation for Description Logics
Abstract. Knowledge compilation is a common technique for propositional logic knowledge bases. The idea is to transform a given knowledge base into a special normal form ([MR03],[D...
Ulrich Furbach, Claudia Obermaier
ICCS
1998
Springer
15 years 4 months ago
Matching in Description Logics: Preliminary Results
Matching of concepts with variables (concept patterns) is a relatively new operation that has been introduced in the context of concept description languages (description logics),...
Franz Baader, Alexander Borgida, Deborah L. McGuin...
EACL
1989
ACL Anthology
15 years 1 months ago
Parsing And Derivational Equivalence
It is a tacit assumption of much linguisticinquiry that alldistinctderivations of a string should assign distinct meanings. But despite the tidinessof such derivational uniqueness...
Mark Hepple, Glyn Morrill
ICAI
2009
14 years 9 months ago
An Alternative Representation for QBF
Quantified Boolean formulas are a powerful representation that have been used to capture and solve a variety of problems in Artificial Intelligence. While most research has focused...
Anja Remshagen, Klaus Truemper