Answer Set programming (ASP) is a prominent knowledge representation language with roots in logicprogramming and non-monotonic reasoning. 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-monotonic reasoning. 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-Monotonic reasoning (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.
We present a logical framework allowing us to express assessment of facts (is it proven?) and arguments (is it sound?) together with a proof system to answer these questions. Our motivation is to clarify the notion of...
详细信息
ISBN:
(纸本)9783030205287;9783030205270
We present a logical framework allowing us to express assessment of facts (is it proven?) and arguments (is it sound?) together with a proof system to answer these questions. Our motivation is to clarify the notion of validity in the context of logic-based arguments along different aspects (such as the formulas used and the inference scheme). Originality lies in the possibility for the user to design their own argument schemes. We show that classical inference obtains when arguments are based on classical schemes (e.g. Hilbert axioms). We go beyond classical logic by distinguishing "proven" formulas from "uncontroversial" ones (whose negation is not proven). Hence a formal definition of a fallacious argument: it uses controversial formulas or schemes recognized as illicit. We express some rational arguments and fallacies in the form of schemes.
theoretical studies show that in sonic combinatorial problems. there is a close relationship between classes of tractable instances and the treewidth (tw) of graphs describing their Structure. In the case of satisfiab...
详细信息
ISBN:
(纸本)9783540894384
theoretical studies show that in sonic combinatorial problems. there is a close relationship between classes of tractable instances and the treewidth (tw) of graphs describing their Structure. In the case of satisfiability for quantified Boolean formulas (QBFs). tractable classes can be related to a generalization of treewidth. that we call quantified treewidth In this paper we investigate the practical relevance of computing tw(p) for problem domains encoded as QBFs. We show that,in approximation of tw(p), is a predictor of empirical hardness, and that it is the only parameter among several other candidates which succeeds consistently in being, so. We also provide evidence that QBF solvers benefit front a preprocessing phase geared towards reducing tw(p), and that such phase is a potential enabler for the Solution of hard QBF encodings.
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 problem-solving technologies, such as SAT/...
详细信息
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 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-Monotonic reasoning. 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.
Some modern DPLL-based propositional SAT solvers now have, fast in-memory algorithms for generating unsatisfiability proofs and cores without writing traces to disk. However, in long SAT runs these, algorithms still r...
详细信息
ISBN:
(纸本)9783540894384
Some modern DPLL-based propositional SAT solvers now have, fast in-memory algorithms for generating unsatisfiability proofs and cores without writing traces to disk. However, in long SAT runs these, algorithms still run out of memory. For several of algorithms. here we discuss advantages and disadvantages, based on carefully designed experiments with our implementation of one, of them, as well as with (our implementation of) Zhang and Malik's one writing traces on disk. then we describe a new in-memory algorithm which saves space by doing more bookkeeping to discard unnecessary information, and show that it can handle significantly more instances than the previously existing, algorithms at negligible expense in time.
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-monotonic reasoning 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-monotonic reasoning 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.
this paper introduces Compositional Neural logicprogramming (CNLP), a framework that integrates neural networks and logicprogramming for symbolic and sub-symbolic reasoning. We adopt the idea of compositional neural...
详细信息
ISBN:
(纸本)9780999241196
this paper introduces Compositional Neural logicprogramming (CNLP), a framework that integrates neural networks and logicprogramming for symbolic and sub-symbolic reasoning. We adopt the idea of compositional neural networks to represent first-order logic predicates and rules. A voting backward-forward chaining algorithm is proposed for inference with both symbolic and sub-symbolic variables in an argument-retrieval style. the framework is highly flexible in that it can be constructed incrementally with new knowledge, and it also supports batch reasoning in certain cases. In the experiments, we demonstrate the advantages of CNLP in discriminative tasks and generative tasks.
We propose a method of compiling circumscription into Extended logic Programs which is widely applicable to a class of parallel circumscription as well as a class of prioritized circumscription. In this paper, we show...
详细信息
ISBN:
(纸本)1558604804
We propose a method of compiling circumscription into Extended logic Programs which is widely applicable to a class of parallel circumscription as well as a class of prioritized circumscription. In this paper, we show theoretically that any circumscription those theory contains boththe domain closure axiom and the uniqueness of names axioms can always he compiled into an extended logic program II, so that, whether a ground literal is provable from circumscription or not, can always be evaluated hy deciding whether the literal is true in all answer sets of II, which can be computed by running II under the existing logicprogramming interpreter.
the extend the Constraint logicprogramming (CLP) formalism in order to handle semiring-based constraint systems. this allows us to perform in the same language both constraint solving and optimization. In fact, const...
详细信息
ISBN:
(纸本)1558604804
the extend the Constraint logicprogramming (CLP) formalism in order to handle semiring-based constraint systems. this allows us to perform in the same language both constraint solving and optimization. In fact, constraint systems based on semirings are able to model both classical constraint solving and more sophisticated features like uncertainty, probability, fuzzyness, and optimization. We then provide this class of languages withthree equivalent semantics: model-theoretic, fixpoint and proof-theoretic, in the style of CLP programs.
Our ultimate goal is to conceive an extension of Answer Set programming with language constructs from dynamic (and temporal) logic to provide an expressive computational framework for modeling dynamic applications. To...
详细信息
ISBN:
(纸本)9783030205287;9783030205270
Our ultimate goal is to conceive an extension of Answer Set programming with language constructs from dynamic (and temporal) logic to provide an expressive computational framework for modeling dynamic applications. To address this in a semantically well founded way, we generalize the definition of Dynamic Equilibrium logic to accommodate finite linear time and extend it with a converse operator in order to capture past temporal operators. this results in a general logical framework integrating existing dynamic and temporal logics of Here-and-there over both finite and infinite time. In the context of finite time, we then develop a translation of dynamic formulas into propositional ones that can in turn be translated into logic programs.
暂无评论