Sciweavers

124 search results - page 3 / 25
» Automata can show PSpace results for description logics
Sort
View
LPAR
1999
Springer
13 years 10 months ago
Practical Reasoning for Expressive Description Logics
Abstract. Description Logics (DLs) are a family of knowledge representation formalisms mainly characterised by constructors to build complex concepts and roles from atomic ones. Ex...
Ian Horrocks, Ulrike Sattler, Stephan Tobies
EUROGP
2003
Springer
259views Optimization» more  EUROGP 2003»
13 years 11 months ago
Research of a Cellular Automaton Simulating Logic Gates by Evolutionary Algorithms
This paper presents a method of using genetic programming to seek new cellular automata that perform computational tasks. Two genetic algorithms are used : the first one discovers ...
Emmanuel Sapin, Olivier Bailleux, Jean-Jacques Cha...
CORR
2008
Springer
120views Education» more  CORR 2008»
13 years 5 months ago
On the Complexity of Elementary Modal Logics
Modal logics are widely used in computer science. The complexity of modal satisfiability problems has been investigated since the 1970s, usually proving results on a case-by-case b...
Edith Hemaspaandra, Henning Schnoor
RWEB
2009
Springer
14 years 9 days ago
Description Logics
In this chapter we will introduce description logics, a family of logic-based knowledge representation languages that can be used to represent the terminological knowledge of an a...
Franz Baader
STOC
2001
ACM
123views Algorithms» more  STOC 2001»
14 years 6 months ago
On optimal slicing of parallel programs
Optimal program slicing determines for a statement S in a program whether or not S affects a specified set of statements, given that all conditionals in are interpreted as non-d...
Markus Müller-Olm, Helmut Seidl