158 search results - page 26 / 32 » Space Efficiency of Propositional Knowledge Representation F... |
ICGI
2010
Springer
13 years 5 months ago
2010
Springer
Abstract. We present an exact algorithm for identification of deterministic finite automata (DFA) which is based on satisfiability (SAT) solvers. Despite the size of the low level ...
KR
2000
Springer
13 years 11 months ago
2000
Springer
When reasoning in description, modal or temporal logics it is often useful to consider axioms representing universal truths in the domain of discourse. Reasoning with respect to a...
AAAI
1993
13 years 8 months ago
1993
Roughly speaking, adequatness is the property of a theorem proving method to solve simpler problems faster than more difficult ones. Automated inferencing methods are often not ad...
COORDINATION
2007
Springer
14 years 1 months ago
2007
Springer
Recent advances in middleware technologies propose semantics-aware tuplespaces as an instrument for coping with the requirements of scalability, heterogeneity and dynamism arising ...
ICLP
2010
Springer
13 years 11 months ago
2010
Springer
Abstract. Answer set programming (ASP) is a powerful formalism for knowledge representation and common sense reasoning that allows disjunction in rule heads and nonmonotonic negati...