[图书][B] The clausal theory of types

DA Wolfram - 1993 - dl.acm.org
Historically, logic programming (LP) originated from first order logic (FOL). Two results of
FOL were crucial. The first is Skolem's theorem, according to which we can reformulate …

Propositional SAT solving

J Marques-Silva, S Malik - Handbook of Model Checking, 2018 - Springer
Abstract The Boolean Satisfiability Problem (SAT) is well known in computational
complexity, representing the first decision problem to be proved NP-complete. SAT is also …

[PDF][PDF] Domain Independent Propagation.

T Le Provost, M Wallace - FGCS, 1992 - eclipseclp.org
Recent years have seen the emergence of two main approaches to integrating constraints
into logic programming. The CLP Scheme introduces constraints as basic statements over …

Using ATMS to efficiently verify the termination of rewrite rule programs

M Kurihara, H Kondo, A Ohuchi - International Journal of Software …, 1992 - World Scientific
Assumption-based truth maintenance systems (ATMS) have become powerful and widely
used tools in artificial intelligence problem solvers. In this paper, we apply ATMS to …

ACE: The abstract clause engine

DA Wolfram - International Conference on Automated Deduction, 1990 - Springer
ACE: The abstract clause engine Page 1 ACE: The Abstract Clause Engine DA Wolfram*
Computer Laboratory University of Cambridge England ACE (Abstract Clause Engine) …

[图书][B] Constraint Logic Planning: A Formal Framework for Nonlinear Planning

Y Zhang - 1994 - search.proquest.com
For deductive planners, planning is a reasoning process within some kind of formal logics.
Deductive planning provides a rigorous approach for planning such that the capabilities and …

[引用][C] The complete K-level tree and its application to data warehouse filtering

马琳 - 高技术通讯: 英文版, 2003

[引用][C] Using ATMS to Efficiently Verify the Termination of Term Rewriting Systems

M Kurihara, H Kondoh, A Ohuchi - Artificial Intelligence in the Pacific Rim …, 1991 - Ios Pr Inc