Sciweavers

1435 search results - page 143 / 287
» Description Logics
Sort
View
LPAR
2004
Springer
15 years 9 months ago
A Decomposition Rule for Decision Procedures by Resolution-Based Calculi
Resolution-based calculi are among the most widely used calculi for theorem proving in first-order logic. Numerous refinements of resolution are nowadays available, such as e.g. ...
Ullrich Hustadt, Boris Motik, Ulrike Sattler
DIMACS
1996
15 years 5 months ago
Easier Ways to Win Logical Games
in Structure'95. 14] R. Fagin. Easier ways to win logical games. In Proc. DIMACS Workshop on Descriptive Complexity and Finite Models, AMS 1997. 15] R. Fagin, L. Stockmeyer, M...
Ronald Fagin
ARITH
1999
IEEE
15 years 8 months ago
A Comparison of Three Rounding Algorithms for IEEE Floating-Point Multiplication
A new IEEE compliant floating-point rounding algorithm for computing the rounded product from a carry-save representation of the product is presented. The new rounding algorithm i...
Guy Even, Peter-Michael Seidel
IGPL
2007
75views more  IGPL 2007»
15 years 4 months ago
Logic for Mathematical Writing
In the School of Mathematical Sciences at Queen Mary in the University of London we have been running a module that teaches the students to write good mathematical English. The mo...
Edmund Harriss, Wilfrid Hodges
JOLLI
2007
128views more  JOLLI 2007»
15 years 4 months ago
Linear temporal logic as an executable semantics for planning languages
This paper presents an approach to artificial intelligence planning based on linear temporal logic (LTL). A simple and easy-to-use planning language is described, PDDL-K (Planning...
Marta Cialdea Mayer, Carla Limongelli, Andrea Orla...