A resolution principle for a logic with restricted quantifiers
This monograph presents foundations for a constrained logic scheme treating constraints as a very general form of restricted quantifiers. The constraints - or quantifier restrictions - are taken from a general constraint system consisting of constraint theory and a set of distinguished constraints....
Bewaard in:
| Hoofdauteur: | |
|---|---|
| Formaat: | Livre numérique |
| Taal: | Anglais |
| Gepubliceerd in: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Reeks: | Lecture notes in computer science. Lecture notes in artificial intelligence
568 |
| Onderwerpen: | |
| Online toegang: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Opmerking: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • A resolution principle for a logic with restricted quantifiers, H.-J. Bürckert, Berlin, Springer-Verlag, 1991, 1 vol. (X-116 p.), Lecture notes in computer science, 3-540-55034-8 • A Resolution Principle for a Logic with Restricted Quantifiers, Texte imprimé, 9783662169322 |
| Samenvatting: | This monograph presents foundations for a constrained logic scheme treating constraints as a very general form of restricted quantifiers. The constraints - or quantifier restrictions - are taken from a general constraint system consisting of constraint theory and a set of distinguished constraints. The book provides a calculus for this constrained logic based on a generalization of Robinson's resolution principle. Technically, the unification procedure of the resolution rule is replaced by suitable constraint-solving methods. The calculus is proven sound and complete for the refutation of sets of constrained clauses. Using a new and elegant generalization of the notion ofa ground instance, the proof technique is a straightforward adaptation of the classical proof technique. The author demonstrates that the constrained logic scheme can be instantiated by well-known sorted logics or equational theories and also by extensions of predicate logics with general equational constraints or concept description languages. |
|---|---|
| Beschrijving item: | Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| ISBN: | 9783540466703 (PDF) |
| ISSN: | 1611-3349 2945-9141 |
| Toegang: | Accès en ligne pour les établissements français bénéficiaires des licences nationales Accès soumis à abonnement pour tout autre établissement Conditions particulières de réutilisation pour les bénéficiaires des licences nationales. https://www.licencesnationales.fr/springer-nature-ebooks-contrat-licence-ln-2017 |