Model Generation with Boolean Constraints | Zendy

Miyuki Koshimura | Zendy; Hiroshi Fujita | Zendy; Ryuzo Hasegawa | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Model Generation with Boolean Constraints

Author(s) -

Miyuki Koshimura,

Hiroshi Fujita,

Ryuzo Hasegawa

Publication year - 2001

Publication title -

lecture notes in computer science

Language(s) - English

Resource type - Book series

SCImago Journal Rank - 0.249

H-Index - 400

eISSN - 1611-3349

pISSN - 0302-9743

ISBN - 3-540-42957-3

DOI - 10.1007/3-540-45653-8_20

Subject(s) - computer science , mathematical proof , simple (philosophy) , constraint logic programming , constraint (computer aided design) , theoretical computer science , boolean expression , boolean data type , constraint satisfaction , algorithm , boolean function , artificial intelligence , mathematics , probabilistic logic , philosophy , geometry , epistemology

We present a simple method for eliminating redundant searches in model generation. The method employs Boolean Constraints which are conjunctions of ground instances of clauses having participated in proofs. Boolean Constraints work as sets of lemmas with which duplicate subproofs and irrelevant model extensions can be eliminated. The method has been tentatively implemented on a constraint logic programming system. We evaluated effects of the method by proving some typical problems taken from the CASC-JS system competition.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research