If you want an extensible theorem prover in Prolog, check out the family of lean theorem provers, of which leanCOP is the main representative; it handles classical first-order logic in 555 bytes of Prolog.
You could use constraint logic programming for your problem. Equality gives you directly a result (example GNU Prolog):
?- X*X #= 4.
X = 2
For inequality you will typically need to ask the system to generate instanciations after the constraints have been set up. This is typically done via a labeling directive (example GNU Prolog):
I've found some tautology checkers, in Mathematical Logic for Computer Science by Ben-Ari, Mordechai, unfortunately they cover boolean logic. What advantage, his implementations are in Prolog, and present a variety of approaches related with automated proving, or solving such equations (or, automatically verifying proofs).
发布评论
评论（3）
如果您想要 Prolog 中的可扩展定理证明器，请查看精益定理证明器系列，其中 leanCOP 是主要代表；它在 555 字节的 Prolog 中处理经典的一阶逻辑。
1.0版本是以下程序：
leanCOP网站具有更多可读版本，具有更多功能。您必须自己实现相等和算术。
If you want an extensible theorem prover in Prolog, check out the family of lean theorem provers, of which leanCOP is the main representative; it handles classical first-order logic in 555 bytes of Prolog.
Version 1.0 is the following program:
The leanCOP website has more readable versions, with more features. You'll have to implement equality and arithmetic yourself.
您可以使用约束逻辑编程来解决您的问题。平等
直接给你一个结果（例如 GNU Prolog）：
对于不等式，你通常需要要求系统生成
设置约束后的实例化。这通常是
通过标签指令完成（例如 GNU Prolog）：
可以在此处找到显示哪些 prolog 具有哪种 CLP 的列表。只是
检查 CLP 多列。
Prolog 系统概述，Ulrich Neumerkel
再见
You could use constraint logic programming for your problem. Equality
gives you directly a result (example GNU Prolog):
For inequality you will typically need to ask the system to generate
instanciations after the constraints have been set up. This is typically
done via a labeling directive (example GNU Prolog):
A list that shows which prologs do have which kind of CLP can be found here. Just
check the CLP multi column.
Overview of Prolog Systems, Ulrich Neumerkel
Bye
我在 中找到了一些同义反复检查器Ben-Ari、Mordechai 的《计算机科学数学逻辑》，不幸的是，它们涵盖了布尔逻辑。他的优点是在 Prolog 中实现，并提出了与自动证明或求解此类方程（或自动验证证明）相关的各种方法。
I've found some tautology checkers, in Mathematical Logic for Computer Science by Ben-Ari, Mordechai, unfortunately they cover boolean logic. What advantage, his implementations are in Prolog, and present a variety of approaches related with automated proving, or solving such equations (or, automatically verifying proofs).