排序方式: 共有3条查询结果,搜索用时 15 毫秒
1
1.
Horatiu Cirstea Claude Kirchner Radu Kopetz Pierre-Etienne Moreau 《Journal of Symbolic Computation》2010
Negation is intrinsic to human thinking and most of the time when searching for something, we base our patterns on both positive and negative conditions. This should be naturally reflected in software that provide pattern-based searches. We would like for example to specify that we search for white cars that are not station wagons, or that we search for a list of objects that does not contain two identical elements. 相似文献
2.
We show thatE-disunification is semi-decidable when the theoryE is presented by a ground convergent rewrite system, and we give a sound and completeE-disunification procedure based on narrowing. A variant of the procedure allows solving systems of equations and disequations, such as the ones that appear in logic programming languages. We show two cases where the efficiency of theE-disunification procedure is similar to the efficiency of theE-unification procedure, namely theories with free constructors and left linear systems. We also show that, in the general case,E-disunification is not decidable even whenE-unification is decidable and finitary. 相似文献
3.
1