4617 search results - page 345 / 924 » Automation of Diagrammatic Reasoning |
158
click to vote
CADE
2006
Springer
16 years 7 months ago
2006
Springer
The nominal datatype package implements an infrastructure in Isabelle/HOL for defining languages involving binders and for reasoning conveniently about alpha-equivalence classes. P...
193
click to vote
CADE
2003
Springer
16 years 7 months ago
2003
Springer
In this paper we present a translation principle, called the axiomatic translation, for reducing propositional modal logics with background theories, including triangular propertie...
209
click to vote
KR
2010
Springer
2010
Springer
Repair and Prediction (under Inconsistency) in Large Biological Networks with Answer Set Programming
15 years 11 months ago
We address the problem of repairing large-scale biological networks and corresponding yet often discrepant measurements in order to predict unobserved variations. To this end, we ...
194
Voted
TPHOL
2000
IEEE
15 years 11 months ago
2000
IEEE
Theorem provers for higher-order logics often use tactics to implement automated proof search. Tactics use a general-purpose metalanguage to implement both general-purpose reasonin...
159
click to vote
DLOG
2007
15 years 9 months ago
2007
We now know that the addition of a concept constructor called a Path Functional Dependency (PFD) to the Boolean-complete description logic DLF leads to undecidability of ABox consi...