the proceedings contain 30 papers. the special focus in this conference is on logicprogramming and nonmonotonicreasoning. the topics include: Fixed parameter complexity in AI and nonmonotonicreasoning;classifying s...
ISBN:
(纸本)3540667490
the proceedings contain 30 papers. the special focus in this conference is on logicprogramming and nonmonotonicreasoning. the topics include: Fixed parameter complexity in AI and nonmonotonicreasoning;classifying semi-normal default logic on the basis of its expressive power;locally determined logic programs;annotated revision programs;belief, knowledge, revisions, and a semantics of non-monotonicreasoning;an argumentation framework for reasoning about actions and changes;representing transition systems by logic programs;transformations of logic programs related to causality and planning;from causal theories to logic programs;monotone expansion of updates in logical databases;updating extended logic programs through abduction;pushing goal derivation in DLP computations;linear tabulated resolution for well founded semantics;minimal founded semantics for disjunctive logicprogramming;on the role of negation in choice logic programs;approximating reiter’s default logic;coherent well-founded annotated logic programs;many-valued disjunctive logic programs with probabilistic semantics;extending disjunctive logicprogramming by T-norms;extending the stable model semantics with more expressive rules;stable model semantics for weight constraint rules;towards first-order nonmonotonicreasoning;comparison of sceptical NAF-free logicprogramming approaches;characterizations of classes of programs by three-valued operators;using LPNMR for problem specification and code generation;answer set planning;world-modeling vs. world-axiomatizing and extended inheritance techniques to solve real-world problems.
the proceedings contain 25 papers. the special focus in this conference is on logicprogramming and nonmonotonicreasoning. the topics include: Founded World Views with Autoepistemic Equilibrium logic;towards Dynamic ...
ISBN:
(纸本)9783030205270
the proceedings contain 25 papers. the special focus in this conference is on logicprogramming and nonmonotonicreasoning. the topics include: Founded World Views with Autoepistemic Equilibrium logic;towards Dynamic Answer Set programming over Finite Traces;a Sequent-Type Calculus for three-Valued Default logic, Or: Tweety Meets Quartum non Datur;diagnosing Data Pipeline Failures Using Action Languages;repair-Based Degrees of Database Inconsistency;elect: An Inconsistency Handling Approach for Partially Preordered Lightweight Ontologies;Elaboration Tolerant Representation of Markov Decision Process via Decision-theoretic Extension of Probabilistic Action Language pBC+;Evaluation of Disjunctive Programs in WASP;telingo = ASP + Time;Telco Network Inventory Validation with NoHR;verifying Strong Equivalence of Programs in the Input Language of gringo;the Return of xorro;Degrees of Laziness in Grounding: Effects of Lazy-Grounding Strategies on ASP Solving;Enhancing DLV for Large-Scale reasoning;Pruning External Minimality Checking for ASP Using Semantic Dependencies;declarative Local Search for Predicate logic;An ASP-Based Framework for the Manipulation of Articulated Objects Using Dual-Arm Robots;C-ASP: Continuous ASP-Based reasoning over RDF Streams;internet Routing and non-monotonicreasoning;assessing Arguments with Schemes and Fallacies;simple Contrapositive Assumption-Based Frameworks;Argumentation-Based Explanations for Answer Sets Using ADF;treewidth and Counting Projected Answer Sets.
Answer Set programming (ASP) is a prominent knowledge representation language with roots in logicprogramming and non-monotonicreasoning. Biennial ASP competitions are organized in order to furnish challenging benchm...
详细信息
Answer Set programming (ASP) is a prominent knowledge representation language with roots in logicprogramming and non-monotonicreasoning. Biennial ASP 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 on the design and results of the Seventh ASP Competition, 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).
Ford has introduced a non-monotoniclogic, System LS, inspired by an empirical study of human non-monotonicreasoning. We define here a defeasible logic FDL based on Ford's logic, and in doing so identify some sim...
详细信息
ISBN:
(纸本)9783642162411
Ford has introduced a non-monotoniclogic, System LS, inspired by an empirical study of human non-monotonicreasoning. We define here a defeasible logic FDL based on Ford's logic, and in doing so identify some similarities and differences between Ford's logic and existing defeasible logics. Several technical results about FDL are established, including its inference strength in relation to other defeasible logics.
the 30th edition of the internationalconference of logicprogramming took place in Vienna in July 2014 at the Vienna Summer of logic - the largest scientific conference in the history of logic. Following the initiati...
详细信息
the 30th edition of the internationalconference of logicprogramming took place in Vienna in July 2014 at the Vienna Summer of logic - the largest scientific conference in the history of logic. Following the initiative in 2010 taken by the Association for logicprogramming and Cambridge University Press, the full papers accepted for the internationalconference on logicprogramming again appear as a special issue of theory and Practice of logicprogramming (TPLP) - the 30thinternationalconference on logicprogramming Special Issue. Papers describing original, previously unpublished research and not simultaneously submitted for publication elsewhere were solicited in all areas of logicprogramming including but not restricted to: theory: Semantic Foundations, Formalisms, non- monotonicreasoning, Knowledge Representation; Implementation: Compilation, Memory Management, Virtual Machines, Parallelism; Environments: Program Analysis, Transformation, Validation, Verification, Debugging, Profiling, Testing; Language Issues: Concurrency, Objects, Coordination, Mobility, Higher Order, Types, Modes, Assertions, programming Techniques; Related Paradigms: Abductive logicprogramming, Inductive logicprogramming, Constraint logicprogramming, Answer-Set programming; Applications: Databases, Data Integration and Federation, Software Engineering, Natural Language Processing, Web and Semantic Web, Agents, Artificial Intelligence, Bioinformatics.
Following the initiative in 2010 taken by the Association for logicprogramming and Cambridge University Press, the full papers accepted for the internationalconference on logicprogramming again appear as a special ...
详细信息
Following the initiative in 2010 taken by the Association for logicprogramming and Cambridge University Press, the full papers accepted for the internationalconference on logicprogramming again appear as a special issue of theory and Practice of logicprogramming (TPLP)-the 27thinternationalconference on logicprogramming Special Issue. Papers describing original, previously unpublished research and not simultaneously submitted for publication elsewhere were solicited in all areas of logicprogramming including but not restricted to: theory: Semantic Foundations, Formalisms, non- monotonicreasoning, Knowledge Representation.
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.
Although it has been shown that non-monotonicreasoning is presumably harder than classical reasoning, there are cases where a non-monotonic treatment actually simplifies matters. Indeed, one of the reasons for consid...
详细信息
ISBN:
(纸本)3540632557
Although it has been shown that non-monotonicreasoning is presumably harder than classical reasoning, there are cases where a non-monotonic treatment actually simplifies matters. Indeed, one of the reasons for considering non-monotonic systems is the hope of speeding up reasoning, and not to slow it down. In this paper, we consider proof lengths in a cut-free sequent calculus, and we show that the application of circumscription (or completion) to certain first-order formulae leads to a non-elementary speed-up of proof length. this is possible because the introduction of the completion formula can simulate the cut rule.
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.
暂无评论