Sciweavers

27 search results - page 5 / 6
» Handling Polymorphism in Automated Deduction
Sort
View
ICLP
2005
Springer
13 years 10 months ago
HYPROLOG: A New Logic Programming Language with Assumptions and Abduction
We present HYPROLOG, a novel integration of Prolog with assumptions and abduction which is implemented in and partly borrows syntax from Constraint Handling Rules (CHR) for integri...
Henning Christiansen, Verónica Dahl
CADE
2001
Springer
14 years 5 months ago
More On Implicit Syntax
Proof assistants based on type theories, such as Coq and Lego, allow users to omit subterms on input that can be inferred automatically. While those mechanisms are well known, ad-h...
Marko Luther
TABLEAUX
2007
Springer
13 years 11 months ago
A Cut-Free Sequent Calculus for Bi-intuitionistic Logic
Bi-intuitionistic logic is the extension of intuitionistic logic with a connective dual to implication. Bi-intuitionistic logic was introduced by Rauszer as a Hilbert calculus with...
Linda Buisman, Rajeev Goré
TAPSOFT
1997
Springer
13 years 9 months ago
Set Operations for Recurrent Term Schematizations
Abstract. Reasoning on programs and automated deduction often require the manipulation of in nite sets of objects. Many formalisms have been proposed to handle such sets. Here we d...
Ali Amaniss, Miki Hermann, Denis Lugiez
ESWS
2008
Springer
13 years 7 months ago
Semantic Metadata Instantiation and Consolidation within an Ontology-based Multimedia Document Management System
Abstract. Automated modeling of appropriate and valid document descriptions is a central issue for the benefit and success of an ontologybased personal document management system. ...
Annett Mitschick, Ralf Nagel 0002, Klaus Meiß...