An interactive, graphical activity scheduler and its implementation in an object oriented constraint logicprogramming language is described. It is known that are consistency techniques are a tractable decision proced...
详细信息
ISBN:
(纸本)185166839X
An interactive, graphical activity scheduler and its implementation in an object oriented constraint logicprogramming language is described. It is known that are consistency techniques are a tractable decision procedure for the temporal constraint networks examined here. the application described permits the specification of any of Allen's 13 binary temporal constraints on activities and thus subsumes precedence scheduling. Arc consistency and intelligent backtracking are part of the scheduler simply as a by-product of the chosen programming language. the result is a natural elegant implementation - which supports incremental and reactive scheduling-that required an astonishingly small amount of coding effort. though the focus is methodology, a comparison of this approach with previous results in temporal constraint satisfaction and representations of temporal reasoning is also included.
the proceedings contain 12 papers. the special focus in this conference is on logicprogramming. the topics include: Human and machine learning of descriptive concepts;the classification and boundary problem;semantics...
ISBN:
(纸本)9783540539193
the proceedings contain 12 papers. the special focus in this conference is on logicprogramming. the topics include: Human and machine learning of descriptive concepts;the classification and boundary problem;semantics of non-monotonic reasoning based on perfect model;time-bounded reasoning in first order knowledge base systems;elementary formal system as a logicprogramming language;debugger for a parallel logicprogramming language fleng;parallel generalized LR parser based on logicprogramming;knowledge media station;cu-prolog and its application to a JPSG parser;table-driven bottom up parser in prolog;a consistency maintenance mechanism for subjective judgements and its application and logic design assistance using temporal logic based language tokio.
An implementation of bounded obligations is demonstrated. Bounded obligations facilitate the expression of requirements such as 'a user must return a book on or before its due date'. the implementation transla...
详细信息
An implementation of bounded obligations is demonstrated. Bounded obligations facilitate the expression of requirements such as 'a user must return a book on or before its due date'. the implementation translates a simple, declarative form of a bounded obligation into the equivalent data structures and operations necessary to ensure its adherence. Incremental development and exploration is achieved by modifying a 'strict' bounded obligation to become 'violatable' together with a way of recognizing when it has been violated. Again, a simple declaration to this effect is appropriately translated by the implementation. Finally, response to such violations can also be declared and automatically translated into running code. the implementation is described and illustrated on examples drawn from a simple library system.< >
ESQL2 is an SQL2 upward-compatible database language that integrates the essential concepts of relational, object-oriented, and deductive databases. ESQL2's salient features are a rich and extendible type system b...
详细信息
ISBN:
(纸本)0818625457
ESQL2 is an SQL2 upward-compatible database language that integrates the essential concepts of relational, object-oriented, and deductive databases. ESQL2's salient features are a rich and extendible type system based on abstract data types (ADTs) implemented in various programming languages, complex objects with object sharing by combining generic ADTs and object identity, the capability of querying and updating relations containing simple or complex objects using SQL-compatible syntax and semantics, and a DATALOG-like deductive capability provided as an extension of the SQL view mechanism. A declarative semantics is proposed for ESQL2 retrieval statements using F-logic, which provides a solid basis for understanding the integration of objects and relations.
the conference materials contain 61 papers on logicprogramming. theory and foundations, applications of logicprogramming, implementations, machines and architectures, programming methodology and tools, relations wit...
详细信息
the conference materials contain 61 papers on logicprogramming. theory and foundations, applications of logicprogramming, implementations, machines and architectures, programming methodology and tools, relations with software engineering, relations with deductive databases, relations with artificial intelligence, extensions, constraints, and logical languages for parallelism are the main topics covered.
the proceedings contain 14 papers. the special focus in this conference is on Parallel logicprogramming held as part of 8th International conference on logicprogramming. the topics include: Debugging parallel strand...
ISBN:
(纸本)9783540550389
the proceedings contain 14 papers. the special focus in this conference is on Parallel logicprogramming held as part of 8th International conference on logicprogramming. the topics include: Debugging parallel strand programs;constraint handling, garbage collection and execution model issues in elipsys;controlling search with meta-brave;solving optimization problems in the aurora or-parallel prolog system;a flexible scheduler in the andorra-i system;performance of muse on the BBN butterfly TC2000;scheduling strategies and speculative work;performance of competitive or-parallelism;blackboard communication in prolog;data parallelism in logicprogramming and an efficient binding management in or-parallel model.
Cover axioms are syntactic conditions on variables in clauses that ensure useful properties of SLDNF resolution. We define generalized cover axioms for characterizing the largest known syntactic classes of recursive p...
详细信息
ISBN:
(纸本)0262560585
Cover axioms are syntactic conditions on variables in clauses that ensure useful properties of SLDNF resolution. We define generalized cover axioms for characterizing the largest known syntactic classes of recursive programs and goals for which SLDNF is complete and straight and computes only ground answers.
We propose the concept of "the classification and boundary problem" and review a few types of reasonings in our daily life from the angle of this problem. As a typical example, we treat the topic of a realiz...
详细信息
暂无评论