[go: up one dir, main page]
More Web Proxy on the site http://driver.im/ skip to main content
Skip header Section
Second Order Quantifier Elimination: Foundations, Computational Aspects and ApplicationsApril 2008
Publisher:
  • College Publications
ISBN:978-1-904987-56-7
Published:17 April 2008
Pages:
320
Skip Bibliometrics Section
Reflects downloads up to 31 Dec 2024Bibliometrics
Skip Abstract Section
Abstract

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.

Cited By

  1. Zheng S and Schmidt R (2023). Saturation-Based Boolean Conjunctive Query Answering and Rewriting for the Guarded Quantification Fragments, Journal of Automated Reasoning, 67:4, Online publication date: 1-Dec-2023.
  2. Seidl H, Müller C and Finkbeiner B How to Win First-Order Safety Games Verification, Model Checking, and Abstract Interpretation, (426-448)
  3. Del-Pinto W and Schmidt R Extending Forgetting-Based Abduction Using Nominals Frontiers of Combining Systems, (185-202)
  4. Hai R and Quix C (2019). Rewriting of plain SO tgds into nested tgds, Proceedings of the VLDB Endowment, 12:11, (1526-1538), Online publication date: 1-Jul-2019.
  5. Zhao Y and Schmidt R On concept forgetting in description logics with qualified number restrictions Proceedings of the 27th International Joint Conference on Artificial Intelligence, (1984-1990)
  6. Zhao Y and Schmidt R Role forgetting for ALCOQH(Δ)-ontologies using an ackermann-based approach Proceedings of the 26th International Joint Conference on Artificial Intelligence, (1354-1361)
  7. Zhao Y and Schmidt R Forgetting concept and role symbols in ALCOIHµ+(∇, ∩)-ontologies Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, (1345-1352)
  8. Wernhard C Second-Order Quantifier Elimination on Relational Monadic Formulas --- A Basic Method and Some Less Expected Applications Proceedings of the 24th International Conference on Automated Reasoning with Analytic Tableaux and Related Methods - Volume 9323, (253-269)
  9. ACM
    Arocena P, Glavic B and Miller R Value invention in data exchange Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data, (157-168)
  10. Wernhard C (2012). Projection and scope-determined circumscription, Journal of Symbolic Computation, 47:9, (1089-1108), Online publication date: 1-Sep-2012.
  11. Doherty P, Dunin-Keplicz B and Szałas A Tractable model checking for fragments of higher-order coalition logic The 10th International Conference on Autonomous Agents and Multiagent Systems - Volume 2, (743-750)
  12. Doherty P and Szałas A On the correctness of rough-set based approximate reasoning Proceedings of the 7th international conference on Rough sets and current trends in computing, (327-336)
  13. ACM
    Arocena P, Fuxman A and Miller R Composing local-as-view mappings Proceedings of the 13th International Conference on Database Theory, (209-218)
  14. Ma$#322;uszy$#324;ski J and Sza$#322;as A Living with inconsistency and taming nonmonotonicity Proceedings of the First international conference on Datalog Reloaded, (384-398)
  15. Vakarelov D Algorithmic Definability and Completeness in Modal Logic Proceedings of the 6th International Symposium on Foundations of Information and Knowledge Systems - Volume 5956, (6-8)
  16. Conradie W, Goranko V and Vakarelov D (2009). Algorithmic Correspondence and Completeness in Modal Logic. III. Extensions of the Algorithm SQEMA with Substitutions, Fundamenta Informaticae, 92:4, (307-343), Online publication date: 1-Dec-2009.
  17. Conradie W, Goranko V and Vakarelov D (2009). Algorithmic Correspondence and Completeness in Modal Logic. III. Extensions of the Algorithm SQEMA with Substitutions, Fundamenta Informaticae, 92:4, (307-343), Online publication date: 30-Jun-2009.
  18. Doherty P and Szałas A Reasoning with qualitative preferences and cardinalities using generalized circumscription Proceedings of the Eleventh International Conference on Principles of Knowledge Representation and Reasoning, (560-570)
Contributors
  • King's College London
  • The University of Manchester
  • University of Warsaw
Please enable JavaScript to view thecomments powered by Disqus.

Recommendations