Sciweavers

1818 search results - page 246 / 364
» Granularity-Adaptive Proof Presentation
Sort
View
106
Voted
ECAI
2000
Springer
15 years 8 months ago
Explaining ALC Subsumption
Knowledge representation systems, including ones based on Description Logics (DLs), use explanation facilities to, among others, debug knowledge bases. Until now, such facilities w...
Alexander Borgida, Enrico Franconi, Ian Horrocks
162
Voted
CLIMA
2004
15 years 5 months ago
Weighted Multi Dimensional Logic Programs
Abstract. We introduce a logical framework suitable to formalize structures of epistemic agents. Such a framework is based on the notion of weighted directed acyclic graphs (WDAGs)...
Pierangelo Dell'Acqua
CORR
2012
Springer
228views Education» more  CORR 2012»
13 years 11 months ago
Faster Approximate Distance Queries and Compact Routing in Sparse Graphs
A distance oracle is a compact representation of the shortest distance matrix of a graph. It can be queried to retrieve approximate distances and corresponding paths between any p...
Rachit Agarwal, Brighten Godfrey, Sariel Har-Peled
137
Voted
TPHOL
2005
IEEE
15 years 9 months ago
A Structured Set of Higher-Order Problems
Abstract. We present a set of problems that may support the development of calculi and theorem provers for classical higher-order logic. We propose to employ these test problems as...
Christoph Benzmüller, Chad E. Brown
249
Voted
PLDI
2009
ACM
16 years 4 months ago
A decision procedure for subset constraints over regular languages
Reasoning about string variables, in particular program inputs, is an important aspect of many program analyses and testing frameworks. Program inputs invariably arrive as strings...
Pieter Hooimeijer, Westley Weimer