the proceedings contain 34 papers. the special focus in this conference is on logicprogramming and Nonmonotonic reasoning. the topics include: Strong and weak constraints in disjunctive datalog;non-monotonic reasonin...
ISBN:
(纸本)9783540632559
the proceedings contain 34 papers. the special focus in this conference is on logicprogramming and Nonmonotonic reasoning. the topics include: Strong and weak constraints in disjunctive datalog;non-monotonic reasoning with quantified Boolean constraints;complexity of only knowing;affordable classes of normal logic programs;automated reasoning with non-monotonic logics;simulations between programs as cellular automata;separating disbeliefs from beliefs in autoepistemic reasoning;resolution for skeptical stable semantics;computing non-ground representations of stable models;industry needs for integrated information services;towards a systematic approach to representing knowledge in declarative logicprogramming;a paraconsistent semantics with contradiction support detection;a general framework for revising non-monotonic theories;modular logicprogramming and generalized quantifiers;programs with universally quantified embedded implications;generalized query answering in disjunctive deductive databases;towards a disjunctive logicprogramming system;a deductive system for non-monotonic reasoning;flexible solutions to complex problems;an implementation of the stable model and well-founded semantics for normal lp;an implementation platform for query-answering in default logics and the x-ray system, its implementation and evaluation.
As an alternative to planning, an approach to high-level agent control based on concurrent program execution is considered. A formal definition in the situation calculus of such a programming language is presented and...
详细信息
As an alternative to planning, an approach to high-level agent control based on concurrent program execution is considered. A formal definition in the situation calculus of such a programming language is presented and illustrated with a detailed example. the language includes facilities for prioritizing the concurrent execution, interrupting the execution when certain conditions become true, and dealing with exogenous actions. the language differs from other procedural formalisms for concurrency in that the initial state can be incompletely specified and the primitive actions can be user-defined by axioms in the situation calculus.
We present a Prolog program that implements a sound and complete theorem prover for first-order intuitionistic logic. It is based on free-variable semantic tableaux extended by an additional string unification to ensu...
详细信息
ISBN:
(纸本)3540629203
We present a Prolog program that implements a sound and complete theorem prover for first-order intuitionistic logic. It is based on free-variable semantic tableaux extended by an additional string unification to ensure the particular restrictions in intuitionistic logic. Due to the modular treatment of the different logical connectives the implementation can easily be adapted to deal with other non-classical logics.
the advantages of FLORID as a deductive object-oriented databaSe system are the rich object-oriented modeling facilities of its language Flogic. the focus of this paper is on FLORID’S multiple inheritance mechanism w...
详细信息
the area of information retrieval is concerned, in particular, with selecting documents from a collection that will be of interest to an user with a stated information need or question. Although it remains an area of ...
详细信息
the area of information retrieval is concerned, in particular, with selecting documents from a collection that will be of interest to an user with a stated information need or question. Although it remains an area of considerable theoretical and practical importance, in general it comes to be critical when one considers the organization and functioning of a Public Prosecution Service, in terms of its administrative procedures, service distribution or the application of the Law. this article describes a part of a project, the MAD's one, A Decision Support System for Legal reasoning, with mention to the architecture and the formal model for retrieval and update of legal documents, in use at the Portuguese Public Prosecution Service. It combines agent's based technology, disjunctive logicprogramming to the representation of partial information, and inference based semantic nets.
In this paper, we define and investigate the complexity of several nonmonotonic logics with quantified Boolean formulas as constraints. We give quantified constraint versions of the constraint programming formalism of...
详细信息
One of the many abilities that distinguish a mathematician from an automated deduction system is to be able to offer appropriate expressions based on intuition and experience that are substituted for existentially qua...
详细信息
ISBN:
(纸本)3540631046
One of the many abilities that distinguish a mathematician from an automated deduction system is to be able to offer appropriate expressions based on intuition and experience that are substituted for existentially quantified variables so as to simplify the problem at hand substantially. We propose to simulate this ability with a technique called genetic programming for use in automated deduction. We apply this approach to problems of combinatory logic. Our experimental results show that the approach is viable and actually produces very promising results. A comparison withthe renowned theorem prover OTTER underlines the achievements.
the Smodels system is a C++ implementation of the well-founded and stable model semantics for range-restricted function-free normal programs. the system includes two modules: (i) smodels which implements the two seman...
详细信息
ISBN:
(纸本)3540632557
the Smodels system is a C++ implementation of the well-founded and stable model semantics for range-restricted function-free normal programs. the system includes two modules: (i) smodels which implements the two semantics for ground programs and (ii) parse which computes a grounded version of a range-restricted function-free normal program. the latter module does not produce the whole set of ground instances of the program but a subset that is sufficient in the sense that no stable models ate lost. the implementation of the stable model semantics for ground programs is based on bottom-up backtracking search where a powerful pruning method is employed. the pruning method exploits an approximation technique for stable models which is closely related to the well-founded semantics. One of the advantages of this novel technique is that it can be implemented to work in linear space. this makes it possible to apply the stable model semantics also in areas where resulting programs are highly non-stratified and can possess a large number of stable models. the implementation has been tested extensively and compared with a state of the art implementation of the stable model semantics, the SLG system. In tests involving ground programs it clearly outperforms SLG.
Proof-search (the basis of logicprogramming) with multiplicative inference rules, such as linear logic's xR and (sic)L, is problematic because of the required non-deterministic splitting of resources. Similarly, ...
详细信息
ISBN:
(纸本)3540631046
Proof-search (the basis of logicprogramming) with multiplicative inference rules, such as linear logic's xR and (sic)L, is problematic because of the required non-deterministic splitting of resources. Similarly, searching with additive rules such as &L and +R requires a nondeterministic choice between two formulae. Many strategies which resolve such non-determinism, either locally or globally, are available. We present a characterization of a range of strategies for distributing and selecting resources in linear sequent calculus proof-search via a sequent calculus annotated with Boolean constraints. Strategies are characterized by calculations of solutions of sets of Boolean equations generated by searches. Our characterization encompasses lazy (or local), eager (or global) and intermediate (mixed local and global) strategies.
暂无评论