Hybrid knowledge bases (HKBs), proposed by Nerode and Subrahmanian, provide a uniform theoretical framework for dealing withthe mixed data types and multiple reasoning modes required for solving logical deployment pr...
详细信息
ISBN:
(纸本)0819412015
Hybrid knowledge bases (HKBs), proposed by Nerode and Subrahmanian, provide a uniform theoretical framework for dealing withthe mixed data types and multiple reasoning modes required for solving logical deployment problems. Algorithms based on mixed integer linear programming techniques have been developed for the syntactic subset of HKBs corresponding to function-free Prolog-like logic programs. In this study, we examine the ability of neural networks to solve a more comprehensive set of problems expressed within the hybrid knowledge base framework. the objective of this research is to design and implement a nonlinear optimization procedure for solving extended logic programs with neural networks. We focus upon two types of extensions which are typically required in the formulation of logical deployment problems. the first type of extension, which we shall refer to as a Type I extension, consists of embedding numerical and geometric constraints into logic programs. the second type of extension, which we shall call a Type II extension, consists of incorporating optimization problems into logic clauses.
We propose an extension to Definite Horn Clauses by placing partial orders on the bodies of clauses. Such clauses are called relaxable clauses. these partial orders are interpreted as a specification of relaxation cri...
详细信息
the proceedings contain 36 papers. the special focus in this conference is on Computer Analysis of Images and Patterns. the topics include: Entailment and disentailment of order-sorted feature constraints;prolog with ...
ISBN:
(纸本)9783540569442
the proceedings contain 36 papers. the special focus in this conference is on Computer Analysis of Images and Patterns. the topics include: Entailment and disentailment of order-sorted feature constraints;prolog with arrays and bounded quantifications;linear 0-1 inequalities and extended clauses;search space pruning by checking dynamic term growth;a proof search syste;ctive systems;consistency checking of automata functional specifications;yet another application for toupie: verification of mutual exclusion algorithms;iffault, antoine rauzy parsing with DCG-terms;a first order resolution calculus with symmetries;ordered paramodulation and resolution as decision procedure;static analysis of prolog with cut;a new type theory for representing logics;verification of switch-level designs with many-valued logic;deciding in HFS-theory via linear integer p’rogramming;the completion of typed logic programs and SLDNF-resolution;increasing the versatility of heuristic based theorem provers;sequentialization of parallel logic programs with mode analysis;refinements and extensions of model elimination;executable specifications based on dynamic algebras;generic resolution in propositional modal systems;optimized translation of multi modal logic into predicate logic;default reasoning with a constraint resolution principle;non-clausal deductive techniques for computing prime implicants and prime implicates;unification under one-sided distributivity with a multiplicative unit;unification in order-sorted logic with term declarations;a system based on the inference of type relations;a comparison of mechanisms for avoiding repetition of subdeductions in chain format linear deduction systems;neutralization and preemption in extended logic programs.
Common non-monotonic deduction systems such as Reiters default logic or inheritance networks must handle the multiple extension problem, i.e. generally they have distinct consistent sets of conclusions (extensions) wh...
详细信息
Extended clauses are the basic formulas of the 0-1 constraint solver used in the constraint logicprogramming language CLP(PB). We present a method for transforming an arbitrary linear 0-1 inequality into a set of ext...
详细信息
作者：
Wagner, GerdGruppe Logik
Wissenstheorie und Information Institut für Philosphie Freie Universität Berlin Habelschwerdter Allee 30 Berlin 331000 Germany
Extended logic programs allow for negative conclusions in rules. So, the question of how to deal with contradictions arises. the trivialization (or ‘explosion’) approach of classical logic, according to which everyt...
详细信息
Metafor is a general purpose Automated theorem Proving (ATP) system for First Order Predicate logic (FOPL) with equality. It is in daily use as a tool aiding researchers working in the field of theory building in the ...
详细信息
We consider logicprogramming languages with a parametric type system, first described by Mycroft and O’Keefe, that allows generic polymorphism. It is well known that provided certain conditions hold typed definite l...
详细信息
We give a reduction, in polynomlaly bounded time, of the satisfiability problem in the set language MPLS, to an equivalent linear integer programming problem. We show that this provide s an algorithm to decide the Set...
详细信息
this paper describes a proof search system for a modal substructural (concatenation) logic based on Gabbay’s Labelled Deductive System (LDS) as a case study. the logic combines resource (linear or Lambek Calculus) wi...
详细信息
暂无评论