Forest logic Programs (FoLP) are a decidable fragment of Open Answer Set programming (OASP) which have the forest model property. OASP extends Answer Set programming (ASP) with open domains—a feature which makes it p...
详细信息
this paper discusses Ctrl, a tool to analyse - both automatically and manually term rewriting withlogical constraints. Ctrl can be used with TRSs on arbitrary underlying logics, and automatically analyse various prop...
详细信息
ISBN:
(纸本)9783662488997;9783662488980
this paper discusses Ctrl, a tool to analyse - both automatically and manually term rewriting withlogical constraints. Ctrl can be used with TRSs on arbitrary underlying logics, and automatically analyse various properties such as termination, confluence and quasi-reductivity. Ctrl also offers both a manual and automatic mode for equivalence tests using inductive theorem proving, giving support for and verification of "hand-written" term equivalence proofs.
TIP is a toolbox for users and developers of inductive provers. It consists of a large number of tools which can, for example, simplify an inductive problem, monomorphise it or find counterexamples to it. We are using...
详细信息
ISBN:
(数字)9783662488997
ISBN:
(纸本)9783662488997;9783662488980
TIP is a toolbox for users and developers of inductive provers. It consists of a large number of tools which can, for example, simplify an inductive problem, monomorphise it or find counterexamples to it. We are using TIP to help maintain a set of benchmarks for inductive theorem provers, where its main job is to encode aspects of the problem that are not natively supported by the respective provers. TIP makes it easier to write inductive provers, by supplying necessary tools such as lemma discovery which prover authors can simply import into their own prover.
My work on PhD thesis consists in nonmonotonic reasoning about spatial relations and how they change in time. Although there are several approaches concerning this topic, to the best of my knowledge, there is no gener...
详细信息
We present a new approach to evaluate conditionals in human reasoning. this approach is based on the weak completion semantics which has been successfully applied to adequately model various other human reasoning task...
详细信息
Answer Set programming (ASP) is a well-known paradigm of declarative programming with roots in logicprogramming and non-monotonic reasoning. Similar to other closely-related problemsolving technologies, such as SAT/S...
详细信息
Rule-based languages are being used for ever more ambitious applications. As program size grows however, so does the overhead of team-based development, reusing components, and just keeping a large flat collection of ...
详细信息
ISBN:
(纸本)9783662488997;9783662488980
Rule-based languages are being used for ever more ambitious applications. As program size grows however, so does the overhead of team-based development, reusing components, and just keeping a large flat collection of rules from interfering. In this paper, we propose a module system for a small logically-motivated rule-based language. the resulting modules are nothing more than rewrite rules of a specific form, which are themselves just logic formulas. Yet, they provide some of the same features found in advanced module systems such as that of Standard ML, in particular name space separation, support for abstract data types, and parametrization (functors in ML). Our modules also offer essential features for concurrent programming such as facilities for sharing private names. this approach is directly applicable to other rule-based languages, including most forward-chaining logicprogramming languages and many process algebras.
We revise some results in Argumentation-based logicprogramming under the umbrella of Satisfiability Modulo CHR (SMCHR), specifically considering Defeasible logicprogramming (DeLP). Strict and defeasible rules in DeL...
详细信息
ISBN:
(纸本)9783319243092;9783319243085
We revise some results in Argumentation-based logicprogramming under the umbrella of Satisfiability Modulo CHR (SMCHR), specifically considering Defeasible logicprogramming (DeLP). Strict and defeasible rules in DeLP can be cast to SMCHR rules, which act as conflict "disentanglers" and implement the theory part. At the same time, we inherit several built-in theory solvers, as SAT, unification, or linear arithmetic ones, which implement the Satisfiability-modulo part. Moreover, we show how to deal with possibilistic extensions of DeLP, i.e., Possibilistic-DeLP, where certainty scores describing the possibility of some events are associated with rules.
We introduce a novel diagnostic reasoning method for robotic systems with multiple robots, to find the causes of observed discrepancies relevant for plan execution. Our method proposes (i) a systematic modification of...
详细信息
暂无评论