977 search results - page 87 / 196 » Logic programming with infinite sets |
113
click to vote
AI
2008
Springer
15 years 20 days ago
2008
Springer
It is well-known that knowledgebases may contain inconsistencies. We provide a framework of measures, based on a first-order four-valued logic, to quantify the inconsistency of a ...
85
Voted
APAL
2010
15 years 20 days ago
2010
Classical proof forests are a proof formalism for first-order classical logic based on Herbrand's Theorem and backtracking games in the style of Coquand. First described by M...
123
click to vote
FBIT
2007
IEEE
15 years 6 months ago
2007
IEEE
This paper describes a decision tree model and 3dimensional representation of information retrieved from various weblogs in relation to argumentative logics. The weblogs are consi...
112
Voted
CP
2006
Springer
15 years 4 months ago
2006
Springer
Ideally, programming propagators as implementations of constraints should be an entirely declarative specification process for a large class of constraints: a high-level declarativ...
90
Voted
CONCURRENCY
2008
15 years 19 days ago
2008
Computational steering is a valuable mechanism for scientific investigation in which the parameters of a running program can be altered and the results visualized immediately. In ...