the proceedings contain 50 papers. the topics discussed include: knowledge acquisition from examples using maximal representation learning;performance analysis of a probabilistic inductive learning system;a comparativ...
ISBN:
(纸本)1558601414
the proceedings contain 50 papers. the topics discussed include: knowledge acquisition from examples using maximal representation learning;performance analysis of a probabilistic inductive learning system;a comparative study of ID3 and backpropagation for English text-to-speech mapping;learning from data with bounded inconsistency;conceptual set covering: improving fit-and-split algorithms;an incremental method for finding multivariate splits for decision trees;incremental induction of topologically minimal trees;graph clustering and model learning by data compression;an analysis of representation shift in concept learning;learning procedures by environment-driven constructive induction;genetic programming: building artificial nervous systems using genetically programmed neural network modules;and improving the performance of genetic algorithms in automated discovery of parameters.
In this article, we present some results of our research focusing on the use of our newest automatedreasoning program OTTER to prove theorems from Robbins algebra, equivalential calculus, implicational calculus, comb...
详细信息
We present a new, efficient and clear method for computing extensions and deriving formulas of a normal default theory which offers a new insight into the nature of default reasoning and seems to be equally successful...
详细信息
We discuss a sequent style clause-based proof system that supports several important strategies in automatic theorem proving. the system has a goal-subgoal structure and supports back chaining with caching;it permits ...
详细信息
We present a series of proof systems for λII-calculus: a theory of first-order dependent function types. the systems are complete for the judgement of interest but differ substantially as bases for algorithmic proof-...
详细信息
In automated deduction systems that are intended for human use, the presentation of a proof is no less important than its discovery. For most of today’s automatedtheorem proving systems, this requires a non-trivial ...
详细信息
We consider a form of linear resolution (called SEI) that requires no factoring and no ancestor resolution. thus, SEI behaves just like SLD, but it can tolerate certain non-Horn clauses and negative clauses. We prove ...
详细信息
the proceedings contain 16 papers. the special focus in this conference is on logicprogramming. the topics include: Completeness of extended unification based on basic narrowing;implementation of full GHC by communic...
ISBN:
(纸本)9783540515647
the proceedings contain 16 papers. the special focus in this conference is on logicprogramming. the topics include: Completeness of extended unification based on basic narrowing;implementation of full GHC by communicating processes;inference methods and semantics on or-type knowledge bases;access program to minimize redundant refutations on the network database system;eUODHILOS: A general-purpose reasoning assistant system — Concept and implementation —;logic based lexical analyser LAX;extraction of characteristic facts and abstract generation;knowledge representation and reasoning for discourse understanding;proving definite clauses without explicit use of inductions;pseudo extension in default reasoning and belief revision by model inference;an approach to nonmonotonic inference mechanism in production system KORE/IE;nonmonotonic parallel inheritance network;logicprogramming debugger using control flow specification;aLEX: the logicprogramming language with explicit control and without cut-operators;lattice programming methodology;a simple programming system written in GHC and its reflective operations.
Using the notions of logic field and ion defined in [7, 9], we give an algorithmic analysis, in terms of logicprogramming, of three paradoxes: Protagoras, Newcomb and the Hangman. We show that each one of these parad...
详细信息
the proceedings contain 47 papers. the special focus in this conference is on Fundamentals of Computation theory. the topics include: Completeness in approximation classes;separating completely complexity classes rela...
ISBN:
(纸本)9783540514985
the proceedings contain 47 papers. the special focus in this conference is on Fundamentals of Computation theory. the topics include: Completeness in approximation classes;separating completely complexity classes related to polynomial size Ω-decision trees;on product hierarchies of automata;on the communication complexity of planarity;Context-free NCE graph grammars;dynamic data structures with finite population: A combinatorial analysis;iterated deterministic top-down look-ahead;using generating functions to compute concurrency;a logic for nondeterministic functional programs;Complexity classes with complete problems between P and NP-C;decision problems and Coxeter groups;complexity of formula classes in first order logic with functions;normal and sinkless Petri nets;descriptive and computational complexity;the effect of null-chains on the complexity of contact schemes;monte-Carlo inference and its relations to reliable frequency identification;semilinear real-time systolic trellis automata;inducibility of the composition of frontier-to-root tree transformations;on oblivious branching programs of linear length;some time-space bounds for one-tape deterministic turing machines;interpretations of synchronous flowchart schemes;rank of rational finitely generated W-languages;extensional properties of sets of time bounded complexity;learning under uniform distribution;an extended framework for default reasoning;logicprogramming of some mathematical paradoxes;analysis of compact 0-complete trees: A new access method to large databases;representation of recursively enumerable languages using alternating finite tree recognizers;about a family of binary morphisms which stationary words are Sturmian;on the finite degree of ambiguity of finite tree automata;approximation algorithms for channel assignment in cellular radio networks;Generalized Boolean hierarchies and Boolean hierarchies over RP.
暂无评论