THEOREM-PROVING FOR INTENSIONAL LOGIC

被引：2

作者：

RAMSAY, A ^{[1
]}

机构：

[1] UNIV COLL DUBLIN,DEPT COMP SCI,DUBLIN 4,IRELAND

来源：

JOURNAL OF AUTOMATED REASONING | 1995年 / 14卷 / 02期

关键词：

INTENSIONAL LOGIC; KNOWLEDGE REPRESENTATION; PROPERTY THEORY;

D O I：

10.1007/BF00881857

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

For a number of tasks in knowledge representation, and particularly in natural language semantics, it is useful to be able to treat propositions and properties as objects - as items that can appear as arguments of predicates, as things one can quantify over, and so on. Logics that support such ''intensional'' operations are notoriously hard to work with. The current paper presents a theorem prover for one such logic, namely, Turner's property theory.

引用

页码：237 / 255

页数：19

共 50 条

[21] AUTOMATED THEOREM-PROVING METHODS
NOSSUM, R
BIT, 1985, 25 (01): : 51 - 64
[22] THEOREM-PROVING AND SOFTWARE ENGINEERING
JONES, CB
SOFTWARE ENGINEERING JOURNAL, 1988, 3 (01): : 2 - 2
[23] VECTORIZATION OF A GENERALIZED PROCEDURE FOR THEOREM-PROVING IN PROPOSITIONAL LOGIC ON VECTOR COMPUTERS
FANG, MY
CHEN, WT
IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 1992, 4 (05) : 475 - 486
[24] Theorem-Proving Analysis of Digital Control Logic Interacting with Continuous Dynamics
Hulette, Geoffrey C.
Armstrong, Robert C.
Mayo, Jackson R.
Ruthruff, Joseph R.
ELECTRONIC NOTES IN THEORETICAL COMPUTER SCIENCE, 2015, 317 : 71 - 83
[25] FROM LOGIC DESIGN TO LOGIC PROGRAMMING - THEOREM-PROVING TECHNIQUES AND P-FUNCTIONS
SNYERS, D
THAYSE, A
LECTURE NOTES IN COMPUTER SCIENCE, 1987, 271 : 1 - 125
[26] A SUBSUMPTION ARCHITECTURE FOR THEOREM-PROVING
BUNDY, A
PHILOSOPHICAL TRANSACTIONS OF THE ROYAL SOCIETY A-MATHEMATICAL PHYSICAL AND ENGINEERING SCIENCES, 1994, 349 (1689): : 71 - 85
[27] A MACHINE PROGRAM FOR THEOREM-PROVING
DAVIS, M
LOGEMANN, G
LOVELAND, D
COMMUNICATIONS OF THE ACM, 1962, 5 (07) : 394 - 397
[28] THEOREM-PROVING LANGUAGE FOR EXPERIMENTATION
HENSCHEN, L
OVERBEEK, R
WOS, L
COMMUNICATIONS OF THE ACM, 1974, 17 (06) : 308 - 314
[29] THEOREM-PROVING WITH RESOLUTION AND SUPERPOSITION
RUSINOWITCH, M
JOURNAL OF SYMBOLIC COMPUTATION, 1991, 11 (1-2) : 21 - 49
[30] A CONSTANT-TIME ALGORITHM FOR THEOREM-PROVING IN PROPOSITIONAL LOGIC ON RECONFIGURABLE MESHES
PRADEEP, B
MURTHY, CSR
INFORMATION SCIENCES, 1995, 85 (1-3) : 175 - 184

← 1 2 3 4 5 →