Titlebook: Constraints in Computational Logics; First International Jean-Pierre Jouannaud Conference proceedings 1994 Springer-Verlag Berlin Heidelbe

affected

書目名稱Constraints in Computational Logics影響因子(影響力)




書目名稱Constraints in Computational Logics影響因子(影響力)學(xué)科排名




書目名稱Constraints in Computational Logics網(wǎng)絡(luò)公開度




書目名稱Constraints in Computational Logics網(wǎng)絡(luò)公開度學(xué)科排名




書目名稱Constraints in Computational Logics被引頻次




書目名稱Constraints in Computational Logics被引頻次學(xué)科排名




書目名稱Constraints in Computational Logics年度引用




書目名稱Constraints in Computational Logics年度引用學(xué)科排名




書目名稱Constraints in Computational Logics讀者反饋




書目名稱Constraints in Computational Logics讀者反饋學(xué)科排名

物種起源

自傳

Local simplification,h clause. The constraints are created when new clauses are generated and inherited by the descendants of that clause. Then the constraints can be used to perform demodulation and unit simplification, if certain conditions are satisfied. This reduces the search space of the theorem proving procedure

omnibus

Simplifying clausal satisfiability problems,g method that simplifies the linear 0–1 integer problem corresponding to a clausal satisfiability problem. Valid extended clauses, a generalization of classical clauses, are added to the problem as long as they dominate at least one extended clause of the problem. We describe how to efficiently obta

Armory

Ordered Binary Decision Diagrams and the Davis-Putnam procedure,al results indicate that the Davis-Putnam procedure outperforms .s in hard constraint-satisfaction problems, while .s are clearly superior for Boolean functional equivalence problems from the circuit domain, and, in general, problems that require the schematization of a large number of solutions tha

moribund

moribund

Constraints for polymorphic behaviours of concurrent ML,cution and resemble terms of a process algebra. The algorithm uses unification for the (essentially) free algebra of types and algebraic reconstruction for collecting constraints for the non-free algebra of behaviours. The algorithm and the statement and proof of soundness are designed so as to make

健談的人

A confluent relational calculus for higher-order programming with constraints,ogramming with first-order constraints, and subsumes higher-order functional programming as a special case. It captures important aspects of the concurrent constraint programming language Oz. We prove the uniform confluence of the .-calculus. Uniform confluence implies that all maximal derivations i

LAIR

ABOUT

Higher order disunification: Some decidable cases,l connectives ∧ and ∨ and universal and existential quantification. Contrary to the first-order case, higher-order disunification is undecidable and even not semi-decidable since it contains higher-order unification and its negation. Therefore we merely give general rules to simplify the basic const