In the context of multi-agent hypothetical reasoning, agents typically have partial knowledge about their environments, and the union of such knowledge is still incomplete to represent the whole world. thus, given a g...
详细信息
the proceedings contain 11 papers. the special focus in this conference is on automated Deduction in Geometry. the topics include: On the Heilbronn optimal configuration of seven points in the square;on the design and...
ISBN:
(纸本)9783642210457
the proceedings contain 11 papers. the special focus in this conference is on automated Deduction in Geometry. the topics include: On the Heilbronn optimal configuration of seven points in the square;on the design and implementation of a geometric knowledge base;proof certificates for algebra and their application to automatic geometry theorem proving;multivariate resultants in Bernstein basis;unique factorization domains in the Java computer algebra system;automatic verification of the adequacy of models for families of geometric objects;formalizing projective plane geometry in Coq;linear programming for Bernstein based solvers;offsetting revolution surfaces.
We introduce a formal argumentation method based on normal programs and rewriting systems which is able to define extensions of the grounded semantics based on specific rewriting rules which perform particular kind of...
详细信息
ISBN:
(纸本)9781607508427;9781607508410
We introduce a formal argumentation method based on normal programs and rewriting systems which is able to define extensions of the grounded semantics based on specific rewriting rules which perform particular kind of reasoning as in reasoning by cases. these new argumentation semantics are intermediate argumentation semantics between the grounded and the preferred semantics.
It has recently been shown that cut-free deep inference systems exhibit an exponential speed-up over cut-free sequent systems, in terms of proof size. While this is good for proof complexity, there remains the problem...
详细信息
ISBN:
(纸本)9783642221187
It has recently been shown that cut-free deep inference systems exhibit an exponential speed-up over cut-free sequent systems, in terms of proof size. While this is good for proof complexity, there remains the problem of typically high proof search non-determinism induced by the deep inference methodology: the higher the depth of inference, the higher the non-determinism. In this work we improve on the proof search side by demonstrating that, for propositional logic, the same exponential speed-up in proof size can be obtained in bounded-depth cut-free systems. these systems retain the top-down symmetry of deep inference, but can otherwise be designed at the same depth level of sequent systems. As a result the non-determinism arising from the choice of rules at each stage of a proof is smaller than that of unbounded deep inference, while still giving access to the short proofs of deep inference.
iTravel is an e-tourism system conceived for helping both employees and customers of a travel agency in finding the best possible travel solution in a short time. the core of iTravel is an ontology which models the do...
详细信息
ISBN:
(纸本)9783790826319
iTravel is an e-tourism system conceived for helping both employees and customers of a travel agency in finding the best possible travel solution in a short time. the core of iTravel is an ontology which models the domain of the touristic offers. the key features of the system are (1) the automatic population of the ontology of the travel offers, obtained by extracting the information contained in the touristic leaflets which are sent by the tour operators to the travel agencies;(2) the intelligent touristic-package search, which mimics the typical deductions of a travel agent. Both features were designed and developed by using two logic-based technologies founded on DLV, a state-of-the-art Answer Set programming system, namely OntoDLV and H iota L epsilon X. the system is developed under PIA project funded by the Calabrian Region, and is a successful result of technological transfer program aimed at a commercial and practical use of basic research on ontology and logicprogramming In the paper we describe the key features of iTravel and report the results of some benchmarks on boththe accuracy of the information extraction process and the efficiency of the reasoning process. Experiments are carried out on real-world data, and confirm the effectiveness of our solution. We also discuss practices and experiences of innovation transfer within the project.
Points-to information is essential in software engineering, including compiler optimization, instruction-level parallelism, program verification, and so on. the propagating of points-to information along paths of a pr...
详细信息
ISBN:
(纸本)9783642247279
Points-to information is essential in software engineering, including compiler optimization, instruction-level parallelism, program verification, and so on. the propagating of points-to information along paths of a program can be viewed as the "frame problem" in a dynamic world. As a primary knowledge representing and reasoning tool in Artificial Intelligence, Answer Set programming (ASP) provides a natural and concise way to express the frame problem. We present a collection of ASP rules to model the propagating of points-to information along paths of an object-oriented program. Withthese rules and basic facts of a program. points-to information at each program point can be computed easily. this makes it possible to acquire useful information for program analysis through existing ASP solvers.
Internal environments in buildings can greatly benefit from the application of automated regulation. Such systems can lower energy consumption and boost user efficiency. Best results can be achieved through the applic...
详细信息
Relationships between entities in a Knowledge Base (KB) are not always explicitly expressed. In addition, entities may implicitly exist within explicit ones. these phenomena are very common when it comes to large-scal...
详细信息
First, we present a novel approach to an abstract preference-based argumentation framework (an abstract PAF), which generalizes Dung's abstract argumentation framework (AF) to deal with additional preferences over...
详细信息
ISBN:
(纸本)9783642219399
First, we present a novel approach to an abstract preference-based argumentation framework (an abstract PAF), which generalizes Dung's abstract argumentation framework (AF) to deal with additional preferences over a set of arguments. In our formalism, the semantics of such a PAF is given as P-extensions that are selected from extensions of acceptability semantics by taking into account such preferences. Second, using a prioritized logic program (PLP) capable of representing priority information along with integrity constraints, the proposed method defines the non-abstract preference-based argumentation framework (the non-abstract PAF) translated from a PLP, whose semantics is also given by P-extensions instantiating those of an abstract one. Finally we show the interesting result that, P-extensions of such a non-abstract PAF under stable semantics capture preferred answer sets of a PLP, which ensures the advantages as well as the correctness of our approach.
Modal Transition Systems (MTSs) provide an appropriate framework for modelling software behaviour when only a partial specification is available. A key characteristic of an MTS is that it explicitly models events that...
详细信息
ISBN:
(纸本)9783939897316
Modal Transition Systems (MTSs) provide an appropriate framework for modelling software behaviour when only a partial specification is available. A key characteristic of an MTS is that it explicitly models events that a system is required to provide and is proscribed from exhibiting, and those for which no specification is available, called maybe events. Incremental elaboration of maybe events into either required or proscribed events can be seen as a process of MTS refinement, resulting from extending a given partial specification with more information about the system behaviour. this paper focuses on providing automated support for computing strong refinements of an MTS with respect to event traces that describe required and proscribed behaviours using a non-monotonic inductive logicprogramming technique. A real case study is used to illustrate the practical application of the approach.
暂无评论