Niet blij met je aankoop? Geeft niet! Je kunt artikelen tot 30 dagen retourneren
Met een cadeaubon zit je altijd goed. De ontvanger kan de cadeaubon voor alles uit ons assortiment inwisselen.
Tot 30 dagen retourrecht
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 there futation of sets of constrained clauses. Using a new and elegant generalization of the notion of a ground instance, the proof technique is a straight forward adaptation of the classical proof technique. The author demonstrates that the constrained logic scheme can be instantiated by well-known sorted logics ore quational theories and also by extensions of predicatelogics with general equational constraints or concept description languages.
Hoi! Ik ben Libroamiko, je boekadviseur.
Hoe kan ik je helpen?