Sciweavers

193 search results - page 12 / 39
» Automated Reasoning in Kleene Algebra
Sort
View
LICS
2002
IEEE
15 years 4 months ago
The Proof Complexity of Linear Algebra
We introduce three formal theories of increasing strength for linear algebra in order to study the complexity of the concepts needed to prove the basic theorems of the subject. We...
Michael Soltys, Stephen A. Cook
CSL
1999
Springer
15 years 4 months ago
A Logical Viewpoint on Process-Algebraic Quotients
We study the following problem: Given a transition system T and its quotient T/∼ under an equivalence ∼, which are the sets L, L′ of Hennessy-Milner formulae such that: if Ï...
Antonín Kucera, Javier Esparza
LPAR
2010
Springer
14 years 9 months ago
Speed-Up Techniques for Negation in Grounding
Abstract. Grounding is the task of reducing a first order formula to ground formula that is equivalent on a given universe, and is important in many kinds of problem solving and re...
Amir Aavani, Shahab Tasharrofi, Gulay Ünel, E...
DEON
2010
Springer
14 years 12 months ago
Towards Metalogical Systematisation of Deontic Action Logics Based on Boolean Algebra
The aim of the present paper is to provide a metalogical systematisation in the area of deontic action logic based on Boolean algebra. Differences among the systems in question lie...
Robert Trypuz, Piotr Kulicki
DLOG
2010
14 years 9 months ago
Query Algebra and Query Optimization for Concept Assertion Retrieval
We develop a query algebra that supports efficient assertion retrieval--a natural extension of instance retrieval. The algebra is based on previously developed techniques for index...
Jeffrey Pound, David Toman, Grant E. Weddell, Jiew...