Maher (2012) introduced an approach for relative expressiveness of defeasible logics, and two notions of relative expressiveness were investigated. Using the first of these definitions of relative expressiveness, we s...
详细信息
Maher (2012) introduced an approach for relative expressiveness of defeasible logics, and two notions of relative expressiveness were investigated. Using the first of these definitions of relative expressiveness, we show that all the defeasible logics in the DL framework are equally expressive under this formulation of relative expressiveness. the second formulation of relative expressiveness is stronger than the first. However, we show that logics incorporating individual defeat are equally expressive as the corresponding logics with team defeat. thus the only differences in expressiveness of logics in DL arise from differences in how ambiguity is handled. this completes the study of relative expressiveness in DL begun in Maher (2012).
We propose an approach for reasoning about actions with domain descriptions including an EL perpendicular to ontology in a temporal action theory. the action theory is based on a Dynamic Linear Time Temporal logic, wh...
详细信息
ISBN:
(纸本)9783031157073;9783031157066
We propose an approach for reasoning about actions with domain descriptions including an EL perpendicular to ontology in a temporal action theory. the action theory is based on a Dynamic Linear Time Temporal logic, whose extensions are defined through temporal answer sets. the work provides conditions under which action consistency can be guaranteed with respect to an EL perpendicular to ontology, by polynomially encoding an EL perpendicular to knowledge base into a domain description of the temporal action theory.
the proceedings contain 18 papers. the topics discussed include: towards legally and ethically correct online HTN planning for data transfer;repairing ontologies via kernel pseudo-contraction;trust graphs for belief r...
the proceedings contain 18 papers. the topics discussed include: towards legally and ethically correct online HTN planning for data transfer;repairing ontologies via kernel pseudo-contraction;trust graphs for belief revision: framework and implementation;bipolar argumentation frameworks with explicit conclusions: connecting argumentation and logicprogramming;conditional syntax splitting, lexicographic entailment and the drowning effect;truth-tracking withnon-expert information sources;argumentation frameworks induced by assumption-based argumentation: relating size and complexity;and a situation-calculus model of knowledge and belief based on thinking about justifications.
Deontic logicprogramming (DLP) is a framework combining deontic logic and non-monotoniclogicprogramming, and it is useful to represent and reason about normative systems. In this paper we propose an implementation ...
详细信息
In the middle of the 1980s, David Poole introduced a semantical, model-theoretic notion of specificity to the artificial-intelligence community. Since then it has found further applications in non-monotonicreasoning,...
详细信息
In the middle of the 1980s, David Poole introduced a semantical, model-theoretic notion of specificity to the artificial-intelligence community. Since then it has found further applications in non-monotonicreasoning, in particular in defeasible reasoning. Poole's notion, however, turns out to be intricate and problematic, which - as we show - can be overcome to some extent by a closer approximation of the intuitive human concept of specificity. Besides the intuitive advantages of our novel specificity ordering over Poole's specificity relation in the classical examples of the literature, we also report some hard mathematical facts: Contrary to what was claimed before, we show that Poole's relation is not transitive. Our new notion of specificity is transitive and also monotonic w.r.t. conjunction.
Default logic is recognized as a powerful framework for knowledge representation and incomplete information management. Its expressive power is suitable for nonmonotonicreasoning, but the counterpart is its very hig...
详细信息
In recent years there has been growing interest in solutions for the delivery of clinical care for the elderly, due to the large increase in aging population. Monitoring a patient in his home environment is necessary ...
详细信息
ISBN:
(纸本)9783642042379
In recent years there has been growing interest in solutions for the delivery of clinical care for the elderly, due to the large increase in aging population. Monitoring a patient in his home environment is necessary to ensure continuity of care in home settings, but this activity must not be too invasive and a burden for clinicians. We prototyped a system called SINDI (Secure and INDependent, living), focused on i) collecting data about the person and the environment through Wireless Sensor Networks (WSN), and ii) reasoning about these data both to contextualize them and to support clinicians in understanding patients' well being as well as ill predicting possible evolutions of their health.
We describe generic methods for reasoning about multiset-based sequent calculi which allow us to combine shallow and deep embeddings as desired. Our methods are modular, permit explicit structural rules, and are widel...
详细信息
ISBN:
(纸本)9783642162411
We describe generic methods for reasoning about multiset-based sequent calculi which allow us to combine shallow and deep embeddings as desired. Our methods are modular, permit explicit structural rules, and are widely applicable to many sequent systems, even to other styles of calculi like natural deduction and term rewriting systems. We describe new axiomatic type classes which enable simplification of multiset or sequent expressions using existing algebraic manipulation facilities. We demonstrate the benefits of our combined approach by formalising in Isabelle/HOL a variant of a recent, non-trivial, pen-and-paper proof of cut-admissibility for the provability logic GL, where we abstract a large part of the proof in a way which is immediately applicable to other calculi. Our work also provides a. machine-checked proof to settle the controversy surrounding the proof of cut-admissibility for GL.
We introduce the method of clausal graph tableaux at the example of hybrid logic with difference and star modalities. Clausal graph tableaux are prefix-free and terminate by construction. they provide an abstract meth...
详细信息
ISBN:
(纸本)9783642162411
We introduce the method of clausal graph tableaux at the example of hybrid logic with difference and star modalities. Clausal graph tableaux are prefix-free and terminate by construction. they provide an abstract method of establishing the small model property of modal logics. In contrast to the filtration method, clausal graph tableaux result in goal-directed decision procedures. Until now no goal-directed decision procedure for the logic considered in this paper was known. there is the promise that clausal graph tableaux lead to a new class of effective decision procedures.
Withthe advent of the Semantic Web, description logics have become one of the most prominent paradigms for knowledge representation and reasoning. Progress in research and applications, however, faces a bottleneck du...
详细信息
ISBN:
(纸本)9783540784685
Withthe advent of the Semantic Web, description logics have become one of the most prominent paradigms for knowledge representation and reasoning. Progress in research and applications, however, faces a bottleneck due to the lack of available knowledge bases, and it is paramount that suitable automated methods for their acquisition will be developed. In this paper, we provide the first learning algorithm based on refinement operators for the most fundamental description logic ALC. We develop the algorithm from thorough theoretical foundations and report on a prototype implementation.
暂无评论