Sciweavers

2585 search results - page 315 / 517
» Automating Coherent Logic
Sort
View
CADE
2006
Springer
16 years 6 months ago
Eliminating Redundancy in Higher-Order Unification: A Lightweight Approach
In this paper, we discuss a lightweight approach to eliminate the overhead due to implicit type arguments during higher-order unification of dependently-typed terms. First, we show...
Brigitte Pientka
CADE
2001
Springer
16 years 6 months ago
A Top-Down Procedure for Disjunctive Well-Founded Semantics
Abstract. Skepticism is one of the most important semantic intuitions in artificial intelligence. The semantics formalizing skeptical reasoning in (disjunctive) logic programming i...
Kewen Wang
MKM
2009
Springer
16 years 1 months ago
Combining Coq and Gappa for Certifying Floating-Point Programs
Abstract. Formal verification of numerical programs is notoriously difficult. On the one hand, there exist automatic tools specialized in floatingpoint arithmetic, such as Gappa...
Sylvie Boldo, Jean-Christophe Filliâtre, Gui...
LICS
2008
IEEE
16 years 1 months ago
Focusing on Binding and Computation
Variable binding is a prevalent feature of the syntax and proof theory of many logical systems. In this paper, we define a programming language that provides intrinsic support fo...
Daniel R. Licata, Noam Zeilberger, Robert Harper
ICLP
2007
Springer
16 years 22 days ago
HD-rules: A Hybrid System Interfacing Prolog with DL-reasoners
The paper presents a prototype system HD-Rules (Hybrid integration of Description Logic and Rules) that integrates normal clauses under the wellfounded semantics with ontologies sp...
Wlodzimierz Drabent, Jakob Henriksson, Jan Maluszy...