2585 search results - page 343 / 517 » Automating Coherent Logic |
184
click to vote
ICLP
2001
Springer
15 years 11 months ago
2001
Springer
We usually use natural language vocabulary for sort names in order-sorted logics, and some sort names may contradict other sort names in the sort-hierarchy. These implicit negation...
188
click to vote
LPAR
2001
Springer
15 years 11 months ago
2001
Springer
The EPGY Theorem-Proving Environment is designed to help students write ordinary mathematical proofs. The system, used in a selection of computer-based proof-intensive mathematics ...
163
click to vote
ECSQARU
1999
Springer
15 years 10 months ago
1999
Springer
In this paper we develop frameworks for logical systems which are able to re ect not only nonmonotonic patterns of reasoning, but also paraconsistent reasoning. For this we conside...
196
click to vote
FLOPS
1999
Springer
15 years 10 months ago
1999
Springer
We describe a new approach to higher-order narrowing computations in a class of systems suitable for functional logic programming. Our approach is based on a translation of these s...
170
click to vote
TPHOL
1999
IEEE
15 years 10 months ago
1999
IEEE
Combining theorem proving and model checking o ers the tantalizing possibility of e ciently reasoning about large circuits at high levels of abstraction. We have constructed a syst...