Sciweavers

850 search results - page 122 / 170
» A Logic Programming Language Based on Binding Algebras
Sort
View
DALT
2005
Springer
15 years 9 months ago
Complete Axiomatizations of Finite Syntactic Epistemic States
An agent who bases his actions upon explicit logical formulae has at any given point in time a finite set of formulae he has computed. Closure or consistency conditions on this se...
Thomas Ågotnes, Michal Walicki
POPL
1995
ACM
15 years 7 months ago
Parametric Program Slicing
Program slicing is a technique for isolating computational threads in programs. In this paper, we show how to mechanically extract a family of practical algorithms for computing s...
John Field, G. Ramalingam, Frank Tip
ICLP
2005
Springer
15 years 9 months ago
Towards Implementations for Advanced Equivalence Checking in Answer-Set Programming
Abstract. In recent work, a general framework for specifying program correspondences under the answer-set semantics has been defined. The framework allows to define different not...
Hans Tompits, Stefan Woltran
VL
2010
IEEE
216views Visual Languages» more  VL 2010»
15 years 2 months ago
Explanatory Debugging: Supporting End-User Debugging of Machine-Learned Programs
Many machine-learning algorithms learn rules of behavior from individual end users, such as taskoriented desktop organizers and handwriting recognizers. These rules form a “prog...
Todd Kulesza, Simone Stumpf, Margaret M. Burnett, ...
JACM
2010
137views more  JACM 2010»
15 years 2 months ago
Reconciling description logics and rules
Description logics (DLs) and rules are formalisms that emphasize different aspects of knowledge representation: whereas DLs are focused on specifying and reasoning about conceptual...
Boris Motik, Riccardo Rosati