Due to its expressiveness and intuitiveness, Probabilistic logicprogramming (PLP) is a useful tool for reasoning in relational domains with uncertainty. However, both inference and learning are expensive tasks. In th...
详细信息
We propose a nonmonotonic Description logic of typicality as a tool for the generation and the exploration of novel creative concepts, that could be useful in many applicative scenarios, ranging from video games to th...
详细信息
ISBN:
(纸本)9783030038403;9783030038397
We propose a nonmonotonic Description logic of typicality as a tool for the generation and the exploration of novel creative concepts, that could be useful in many applicative scenarios, ranging from video games to the creation of new movie characters. In particular, our logic is able to deal withthe phenomenon of prototypical concept combination, which has been shown to be problematic to model for other formalisms like fuzzy logic. the proposed logic relies on the logic of typicality ALC+ T-R, whose semantics is based on a notion of rational closure, as well as on the distributed semantics of probabilistic Description logics, and takes into account the insights coming from the heuristics used by humans for concept composition. Besides providing framework able to account for typicality-based concept combination, we also outline that reasoning in the proposed Description logic is ExpTime-complete as for the underlying ALC.
the proceedings contain 22 papers. the special focus in this conference is on Relational and Algebraic Methods in Computer Science. the topics include: Counting finite linearly ordered involutive bisemilattices;MIX * ...
ISBN:
(纸本)9783030021481
the proceedings contain 22 papers. the special focus in this conference is on Relational and Algebraic Methods in Computer Science. the topics include: Counting finite linearly ordered involutive bisemilattices;MIX * -autonomous quantales and the continuous weak order;calculational verification of reactive programs with reactive relations and Kleene algebra;verifying hybrid systems with modal Kleene algebra;algebraic derivation of until rules and application to timer verification;false failure: Creating failure models for separation logic;Towards an analysis of dynamic gossip in NetKAT;coalgebraic tools for randomness-conserving protocols;algebraic solution of weighted minimax single-facility constrained location problems;C-dioids and μ-continuous Chomsky-algebras;a set solver for finite set relation algebra;on the computational complexity of non-dictatorial aggregation;Calculational relation-algebraic proofs in the teaching tool CALCCHECK;coequalizers and tensor products for continuous idempotent semirings;distances, norms and error propagation in idempotent semirings;t-norm based operations in arrow categories;decidability of equational theories for subsignatures of relation algebra;composition of different-type relations via the Kleisli category for the continuation monad;axiomatizing discrete spatial relations;a modal and relevance logic for qualitative spatial reasoning.
Answer Set programming (ASP) is a well-known paradigm of declarative programming with roots in logicprogramming and non-monotonicreasoning. Similar to other closely related problem-solving technologies, such as SAT/...
详细信息
Answer Set programming (ASP) is a well-known paradigm of declarative programming with roots in logicprogramming and non-monotonicreasoning. Similar to other closely related problem-solving technologies, such as SAT/SMT, QBF, Planning and Scheduling, advancements in ASP solving are assessed in competition events. In this paper, we report about the design and results of the Sixth ASP Competition, which was jointly organized by the University of Calabria (Italy), Aalto University (Finland), and the University of Genoa (Italy), in affiliation withthe 13thinternationalconference on logicprogramming and non-monotonicreasoning. this edition maintained some of the design decisions introduced in 2014, e.g., the conception of sub-tracks, the scoring scheme, and the adherence to a fixed modeling language in order to push the adoption of the ASP-Core-2 standard. On the other hand, it featured also some novelties, like a benchmark selection stage classifying instances according to their empirical hardness, and a "Marathon" track where the top-performing systems are given more time for solving hard benchmarks.
In inductive learning of a broad concept, an algorithm should be able to distinguish concept examples from exceptions and noisy data. An approach through recursively finding patterns in exceptions turns out to corresp...
详细信息
In inductive learning of a broad concept, an algorithm should be able to distinguish concept examples from exceptions and noisy data. An approach through recursively finding patterns in exceptions turns out to correspond to the problem of learning default theories. Default logic is what humans employ in common-sense reasoning. therefore, learned default theories are better understood by humans. In this paper, we present new algorithms to learn default theories in the form of non-monotoniclogic programs. Experiments reported in this paper show that our algorithms are a significant improvement over traditional approaches based on inductive logicprogramming. Under consideration for acceptance in TPLP.
Defeasible logics provide several linguistic features to support the expression of defeasible knowledge. there is also a wide variety of such logics, expressing different intuitions about defeasible reasoning. However...
详细信息
Defeasible logics provide several linguistic features to support the expression of defeasible knowledge. there is also a wide variety of such logics, expressing different intuitions about defeasible reasoning. However, the logics can only combine in trivial ways. this limits their usefulness in contexts where different intuitions are at play in different aspects of a problem. In particular, in some legal settings, different actors have different burdens of proof, which might be expressed as reasoning in different defeasible logics. In this paper, we introduce annotated defeasible logic as a flexible formalism permitting multiple forms of defeasibility, and establish some properties of the formalism.
Answer Set programming (ASP) is a prominent knowledge representation language with roots in logicprogramming and non-monotonicreasoning. Biennial competitions are organized in order to furnish challenging benchmark ...
详细信息
ISBN:
(纸本)9783319616605;9783319616599
Answer Set programming (ASP) is a prominent knowledge representation language with roots in logicprogramming and non-monotonicreasoning. Biennial competitions are organized in order to furnish challenging benchmark collections and assess the advancement of the state of the art in ASP solving. In this paper, we report about the design of the Seventh ASP Competition, which is jointly organized by the University of Calabria (Italy), the University of Genova (Italy), and the University of Potsdam (Germany), in affiliation withthe 14thinternationalconference on logicprogramming and non-monotonicreasoning (LPNMR 2017). A novel feature of this competition edition is the re-introduction of a Model&Solve track, complementing the usual System track with problem domains where participants need to provide dedicated encodings and solving means.
Argumentation has gained popularity in AI in recent years to support several activities and forms of reasoning. this talk will trace back the logicprogramming and non-monotonicreasoning origins of two well-known arg...
详细信息
ISBN:
(纸本)9783319616605;9783319616599
Argumentation has gained popularity in AI in recent years to support several activities and forms of reasoning. this talk will trace back the logicprogramming and non-monotonicreasoning origins of two well-known argumentation formalisms in AI (namely abstract argumentation and assumption-based argumentation). Finally, the talk will discuss recent developments in AI making use of computational argumentation, in particular to support collaborative decision making.
In inductive learning of a broad concept, an algorithm should be able to distinguish concept examples from exceptions and noisy data. An approach through recursively finding patterns in exceptions turns out to corresp...
详细信息
In inductive learning of a broad concept, an algorithm should be able to distinguish concept examples from exceptions and noisy data. An approach through recursively finding patterns in exceptions turns out to correspond to the problem of learning default theories. Default logic is what humans employ in common-sense reasoning. therefore, learned default theories are better understood by humans. In this paper, we present new algorithms to learn default theories in the form of non-monotoniclogic programs. Experiments reported in this paper show that our algorithms are a significant improvement over traditional approaches based on inductive logicprogramming. Under consideration for acceptance in TPLP.
In this paper we integrate priorities in sequent-based argumentation. the former is a useful and extensively investigated tool in the context of non-monotonicreasoning, and the latter is a modular and general way of ...
详细信息
In this paper we integrate priorities in sequent-based argumentation. the former is a useful and extensively investigated tool in the context of non-monotonicreasoning, and the latter is a modular and general way of handling logical argumentation. their combination offers a platform for representing and reasoning with maximally consistent subsets of prioritized knowledge bases. Moreover, many frameworks of the resulting formalisms satisfy common rationality postulates and other desirable properties, like conflict preservation.
暂无评论