2585 search results - page 375 / 517 » Automating Coherent Logic |
140
click to vote
CADE
2002
Springer
16 years 6 months ago
2002
Springer
The reflection theorem has been proved using Isabelle/ZF. This theorem cannot be expressed in ZF, and its proof requires reasoning at the meta-level. There is a particularly elegan...
125
click to vote
CADE
2001
Springer
16 years 6 months ago
2001
Springer
We present a tool deciding a fragment of set theory. It is designed to be easily accessible via the internet and intuitively usable by anyone who is working with sets to describe a...
146
click to vote
CADE
2001
Springer
16 years 6 months ago
2001
Springer
A boolean formula in conjunctive normal form (CNF) F is refuted by literal?once resolution if the empty clause is inferred from F by resolving on each literal of F at most once. Li...
173
click to vote
TIME
2009
IEEE
16 years 1 months ago
2009
IEEE
—Towards a data-centric workflow approach, we introduce an artifact model to capture data and workflow management activities in distributed settings. The model is built on Acti...
171
click to vote
LOPSTR
2009
Springer
16 years 1 months ago
2009
Springer
We propose a new grouping operator for logic programs based on the group_by operator of SQL. The novelty of our proposal lies in the use of modes, which allows us to relax some rat...