We present the first version of our ASP solver ASPeRiX that implements a new approach of answer set computation. The main specifity of our system is to realize a forward chaining of first order rules that are grounded...
详细信息
A smart space is an ecosystem of interacting computational objects embedded in some environment. The space seamlessly provides users with information and services using the best available resources. In this paper, the...
详细信息
We have developed an annotated logic program called an EVALPSN(Extended Vector Annotated logic Program with Strong Negation), which can deal with defeasible deontic reasoning and some kinds of contradiction, and appli...
详细信息
ISBN:
(纸本)3540221174
We have developed an annotated logic program called an EVALPSN(Extended Vector Annotated logic Program with Strong Negation), which can deal with defeasible deontic reasoning and some kinds of contradiction, and applied EVALPSN to automatic safety verification, traffic signal control, robot action control, etc.. Generally, discrete event control can be represented as deontic rules such as it is forbidden for both the cat and mouse to occupy the same room simultaneously, and must deal with contradiction to avoid unexpected system states. We show that such discrete event control can be easily formalized in EVALPSN. In this paper, we introduce the application of EVALPSN to discrete event control with taking a famous example Cat and Mouse.
Many metalanguages and logical frameworks have emerged in recent years that use the terms of the lambda calculus as data structures. A common set of questions govern the suitability of a representation for lambda term...
详细信息
This paper proposes a formalized approach to the specification of experimental tasks in cognitive science. Put briefly, the proposal is to represent the structure of a task by a logic program that accepts only valid e...
详细信息
This paper surveys reduction or evaluation strategies for functional and functional logic programs. Reasonable reduction strategies for declarative languages must be efficiently implementable to be useful in practice....
详细信息
The relationships between configurable computing, ASICs, and microprocessors have several important implications. First, sequential programming languages and related compilation approaches are not likely to be a good ...
详细信息
The relationships between configurable computing, ASICs, and microprocessors have several important implications. First, sequential programming languages and related compilation approaches are not likely to be a good match for highly parallel configurable-computing applications. While it may be possible to achieve moderate speedup, significant speedup will only be achieved by directly exploiting massive amounts of parallelism. This is currently done using low-level circuit design tools. Second, the architectural organization will be much more distributed than is commonly found in existing computer systems. Finally, hybrid systems of microprocessors and FPGAs are best coupled flexibly to fully exploit the best features of each device.
Enriching answer set programming with function symbols makes modeling easier, increases the expressive power, and allows us to deal with infinite domains. However, this comes at a cost: common inference tasks become u...
详细信息
The issue of describing in a formal way solving algorithms in various fields such as Propositional Satisfiability (SAT), Quantified SAT, Satisfiability Modulo Theories, Answer Set programming (ASP), and Constraint ASP...
详细信息
暂无评论