Many Program Verification and Synthesis problems of interest can be modeled directly using Horn clauses and many recent advances in the CLP and CAV communities have centered around efficiently solving problems presented as Horn clauses. The HCVS series of workshops aims to bring together researchers working in the two communities of Constraint/Logic Programming (e.g., ICLP and CP), Program Verification (e.g., CAV, TACAS, and VMCAI), and Automated Deduction (e.g., CADE, IJCAR), on the topic of Horn clause based analysis, verification, and synthesis. Horn clauses for verification and synthesis have been advocated by these communities in different times and from different perspectives and HCVS is organized to stimulate interaction and a fruitful exchange and integration of experiences.

翻译：许多值得关注的方案核查和综合问题可以直接以合恩条款为模型,CLP和CAVA社区最近取得的许多进展以有效解决作为合恩条款提出的问题为中心,HCVS系列讲习班旨在汇集在以下两个社区工作的研究人员:Castrant/Logic Programme (例如,ICLP和CP)、Public Review(例如,CAV、TASAS和VMCAI)和自动降级(例如,CADE、IJCAR),主题是基于合恩条款的分析、核查和综合,这些社区在不同时期从不同角度倡导核查和综合的合角条款,并组织了HCVS,以促进互动和富有成果的经验交流与融合。