We introduce a new class of abstract structures, which we call generalized ultrametric semilattices, and in which the meet operation of the semilattice coexists with a generalized distance function in a tightly coordi...
详细信息
Our purpose is to extend logic programming semantics for programs with some form of denial statements [2] specifying that some sets of literals cannot all belong to the meaning of a program. Denials represent an intui...
详细信息
Sometimes AI has to deal with incomplete problems. Knowledge Representation is the main component to solve the problems in AI. Various Knowledge representation techniques are available to deal with complete informatio...
详细信息
Often graphs are used to investigate properties of logic programs. In general, different graphs represent different kinds of information of the corresponding programs. Sometimes this information is not sufficient for ...
详细信息
Often graphs are used to investigate properties of logic programs. In general, different graphs represent different kinds of information of the corresponding programs. Sometimes this information is not sufficient for solving a certain problem. In this paper we define graphs which are suitable for computing answer sets of different classes of logic programs. Intuitively, a graph associated to a logic program is suitable for answer set semantics if its structure is sufficient to compute the answer sets of the corresponding program. That is, algorithms that use suitable graphs do not have to consider the original logic program any longer. We investigate different classes of graphs which are suitable for answer set computation of normal nested logic programs, normal logic programs and normal programs with at most on positive body atom.
A version of the Situation Calculus is presented whichis able to deal with informationabout the actual occurrenceof actions in time. Baker’s solution to the frame problem using circumscriptionis adaptedto enable defa...
详细信息
We propose a simple notion of model for logic Programs based on indexed monoidal categories. On the one hand our proposal is consistent with well-known techniques for providing a categorical semantics for logical syst...
详细信息
We present first the logic MTL, a real-time temporal logic that is at the heart of the real-time specification language ALBERT. Since this logic is undecidable, we approximate it (using the theory of Abstract Interpre...
详细信息
The EDEE architecture provides a mechanism for explicitly and uniformly capturing business occurrences, and provisions of contracts, policies, and law. EDEE is able to reason about the interactions of intra-, inter-, ...
详细信息
ISBN:
(纸本)1581136064
The EDEE architecture provides a mechanism for explicitly and uniformly capturing business occurrences, and provisions of contracts, policies, and law. EDEE is able to reason about the interactions of intra-, inter-, and extra-organizational policy, and execute business procedures informed by the combined legal effects of these diverse roles. We show through an example how EDEE's asynchronous approach, namely to initiate actions only after consulting the database to determine active obligations, differs from the traditional synchronous approach in which procedural side-effects are initiated when clauses of rules are evaluated. The example show-cases both conflict detection and resolution in EDEE. EDEE'S novel mechanism for business process automation is based on assessment of legal status and directives, and can be contrasted to the conventional task-dependency and process-synchronization approach employed in other workflow systems.
Constraint propagation solvers interleave propagation (removing impossible values from variables domains) with search. Propagation is performed by executing propagators (removing values) implementing constraints (defi...
详细信息
When interpreting a logic Program with a parallel architecture, two kinds of parallelisms arise. These are namely, Or-parallelism and and-parallelism. This study aims to present an interpreter that can exploit Restric...
详细信息
When interpreting a logic Program with a parallel architecture, two kinds of parallelisms arise. These are namely, Or-parallelism and and-parallelism. This study aims to present an interpreter that can exploit Restricted And-parallelism, combined with Or-parallelism. The method relies on different scanning of the search space and works on a new concept that is called multisystem. It is shown that the proposed interpreter outperforms previous classical interpreters.
暂无评论