248 search results - page 39 / 50 » Circuit-based Boolean Reasoning |
121
Voted
ICLP
1997
Springer
15 years 7 months ago
1997
Springer
Kowalski and Sergot’s Event Calculus (EC) is a simple temporal formalism that, given a set of event occurrences, derives the maximal validity intervals (MVIs) over which propert...
125
click to vote
AAAI
2007
15 years 5 months ago
2007
The use of ontologies in various application domains, such as Data Integration, the Semantic Web, or ontology-based data management, where ontologies provide the access to large a...
147
click to vote
CSL
2008
Springer
15 years 4 months ago
2008
Springer
Quantitative generalizations of classical languages, which assign to each word a real number instead of a boolean value, have applications in modeling resource-constrained computat...
133
click to vote
SEBD
2007
15 years 4 months ago
2007
The use of ontologies in various application domains, such as Data Integration, the Semantic Web, or ontology-based data management, where ontologies provide the access to large am...
146
click to vote
LICS
2010
IEEE
15 years 1 months ago
2010
IEEE
Alternating timed automata are a powerful extension of classical Alur-Dill timed automata that are closed under all Boolean operations. They have played a key role, among others, ...