Improved Second-Order Quantifier Elimination in Modal Logic
JELIA '08 Proceedings of the 11th European conference on Logics in Artificial Intelligence
Literal Projection for First-Order Logic
JELIA '08 Proceedings of the 11th European conference on Logics in Artificial Intelligence
A new methodology for developing deduction methods
Annals of Mathematics and Artificial Intelligence
Composing local-as-view mappings: closure and applications
Proceedings of the 13th International Conference on Database Theory
On the correctness of rough-set based approximate reasoning
RSCTC'10 Proceedings of the 7th international conference on Rough sets and current trends in computing
Tractable model checking for fragments of higher-order coalition logic
The 10th International Conference on Autonomous Agents and Multiagent Systems - Volume 2
Algorithmic definability and completeness in modal logic
FoIKS'10 Proceedings of the 6th international conference on Foundations of Information and Knowledge Systems
Living with inconsistency and taming nonmonotonicity
Datalog'10 Proceedings of the First international conference on Datalog Reloaded
Projection and scope-determined circumscription
Journal of Symbolic Computation
Value invention in data exchange
Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data
Automated Generation of Logical Constraints on Approximation Spaces Using Quantifier Elimination
Fundamenta Informaticae - To Andrzej Skowron on His 70th Birthday
Hi-index | 0.00 |
In recent years there has been an increasing use of logical methods and significant new developments have been spawned in several areas of computer science, ranging from artificial intelligence and software engineering to agent-based systems and the semantic web. In the investigation and application of logical methods there is a tension between: * the need for a representational language strong enough to express domain knowledge of a particular application, and the need for a logical formalism general enough to unify several reasoning facilities relevant to the application, on the one hand, and * the need to enable computationally feasible reasoning facilities, on the other hand. Second-order logics are very expressive and allow us to represent domain knowledge with ease, but there is a high price to pay for the expressiveness. Most second-order logics are incomplete and highly undecidable. It is the quantifiers which bind relation symbols that make second-order logics computationally unfriendly. It is therefore desirable to eliminate these second-order quantifiers, when this is mathematically possible; and often it is. If second-order quantifiers are eliminable we want to know under which conditions, we want to understand the principles and we want to develop methods for second-order quantifier elimination. This book provides the first comprehensive, systematic and uniform account of the state-of-the-art of second-order quantifier elimination in classical and non-classical logics. It covers the foundations, it discusses in detail existing second-order quantifier elimination methods, and it presents numerous examples of applications and non-standard uses in different areas. These include: * classical and non-classical logics, * correspondence and duality theory, * knowledge representation and description logics, * commonsense reasoning and approximate reasoning, * relational and deductive databases, and * complexity theory. The book is intended for anyone interested in the theory and application of logics in computer science and artificial intelligence.