In this work, we show that both logicprogramming and abstract argumentation frameworks can be interpreted in terms of Nelson's constructive logic N4. We do so by formalising, in this logic, two principles that we...
详细信息
In this work, we show that both logicprogramming and abstract argumentation frameworks can be interpreted in terms of Nelson's constructive logic N4. We do so by formalising, in this logic, two principles that we call noncontradictory inference and strengthened closed world assumption: the first states that no belief can be held based on contradictory evidence while the latter forces both unknown and contradictory evidence to be regarded as false. Using these principles, both logicprogramming and abstract argumentation frameworks are translated into constructive logic in a modular way and using the object language. logicprogramming implication and abstract argumentation supports become, in the translation, a new implication connective following the noncontradictory inference principle. Attacks are then represented by combining this new implication with strong negation. Under consideration in theory and practice of logic programming (TPLP).
Following the initiative in 2010 taken by the Association for logicprogramming and Cambridge University Press, the full papers accepted for the International Conference 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 International Conference on logicprogramming again appear as a special issue of theory and practice of logic programming (TPLP)—the 27th International Conference 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- monotonic Reasoning, 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.
We are proud to introduce this special issue of the Journal of theory and practice of logic programming (TPLP), dedicated to the full papers accepted for the 28th International Conference on logicprogramming (ICLP). ...
We are proud to introduce this special issue of the Journal of theory and practice of logic programming (TPLP), dedicated to the full papers accepted for the 28th International Conference on logicprogramming (ICLP). The ICLP meetings started in Marseille in 1982 and since then constitute the main venue for presenting and discussing work in the area of logicprogramming.
The proceedings of the International Conference on logicprogramming (ICLP) have had several publishers, including MIT Press and Springer's Lecture Notes in Computer Science. Beginning in 2010, the proceedings hav...
The proceedings of the International Conference on logicprogramming (ICLP) have had several publishers, including MIT Press and Springer's Lecture Notes in Computer Science. Beginning in 2010, the proceedings have been published in a dual format: with regular papers contained in a special issue of theory and practice of logic programming (TPLP), and technical communications as a Dagstuhl LIPics series publication. The reason for the change was that compared to researchers in other fields, computer scientists publish more in conferences or symposia and less in journals. The thinking went that since many ICLP papers are of journal quality – or nearly so – why not publish them in a journal straight away? And why not TPLP?
This note presents a historical survey of informal semantics that are associated with logicprogramming under answer set semantics. We review these in uniform terms and align them with two paradigms: Answer Set Progra...
详细信息
This note presents a historical survey of informal semantics that are associated with logicprogramming under answer set semantics. We review these in uniform terms and align them with two paradigms: Answer Set programming and ASP-Prolog - two prominent Knowledge Representation and Reasoning Paradigms in Artificial Intelligence.
Formal reasoning about finite sets and cardinality is important for many applications. including software verification, where very often one needs to reason about the size of a given data structure. The Constraint Log...
详细信息
Formal reasoning about finite sets and cardinality is important for many applications. including software verification, where very often one needs to reason about the size of a given data structure. The Constraint logicprogramming tool {log} provides a decision procedure for deciding the satisfiability of formulas involving very general forms of finite sets, although it does not provide cardinality constraints. In this paper we adapt and integrate a decision procedure for a theory of finite sets with cardinality into {log}. The proposed solver is proved to be a decision procedure for its formulas. Besides, the new CLP instance is implemented as part of the {log} tool. In turn, the implementation uses Howe and King's Prolog SAT solver and Prolog's CLP(Q) library. as an integer linear programming solver. The empirical evaluation of this implementation based on +250 real verification conditions shows that it can be useful in practice.
Recent advances in knowledge compilation introduced techniques to compile positive logic programs into propositional logic, essentially exploiting the constructive nature of the least fixpoint computation. This approa...
详细信息
Recent advances in knowledge compilation introduced techniques to compile positive logic programs into propositional logic, essentially exploiting the constructive nature of the least fixpoint computation. This approach has several advantages over existing approaches: it maintains logical equivalence, does not require (expensive) loop-breaking preprocessing or the introduction of auxiliary variables, and significantly outperforms existing algorithms. Unfortunately, this technique is limited to negation-free programs. In this paper, we show how to extend it to general logic programs under the well-founded semantics. We develop our work in approximation fixpoint theory, an algebraical framework that unifies semantics of different logics. As such, our algebraical results are also applicable to autoepistemic logic, default logic and abstract dialectical frameworks.
This volume contains the regular papers of the 35th International Conference on logicprogramming (ICLP 2019), held in Las Cruces, New Mexico, USA, from September 20 to September 25, 2019.
This volume contains the regular papers of the 35th International Conference on logicprogramming (ICLP 2019), held in Las Cruces, New Mexico, USA, from September 20 to September 25, 2019.
暂无评论