| 期刊全稱 | A Resolution Principle for a Logic with Restricted Quantifiers | | 影響因子2023 | H. -J. Bürckert | | 視頻video | http://file.papertrans.cn/143/142043/142043.mp4 | | 學科分類 | Lecture Notes in Computer Science | | 圖書封面 |  | | 影響因子 | This monograph presents foundations for a constrainedlogic scheme treating constraints as a very general form ofrestricted quantifiers. The constraints - or quantifierrestrictions - are taken from a general constraint systemconsisting of constraint theory and a set ofdistinguishedconstraints.The book provides a calculus for thisconstrained logicbased on a generalization of Robinson‘s resolutionprinciple. Technically, the unification procedure of theresolution rule is replaced by suitable constraint-solvingmethods. The calculus is proven sound and complete for therefutation of sets of constrained clauses. Using a new andelegant generalization of the notion ofa ground instance,the proof technique is a straightforward adaptation of theclassical proof technique.The author demonstrates that the constrained logic schemecan be instantiated by well-known sorted logicsorequational theories and also by extensions of predicatelogics withgeneral equational constraints or conceptdescription languages. | | Pindex | Book 1991 |
The information of publication is updating
|
|
|Archiver|手機版|小黑屋|
派博傳思國際
( 京公網安備110108008328)
GMT+8, 2025-10-28 22:33
發(fā)表于 2025-3-21 18:08:19
