logicprogramming enjoys a relatively good relationship between its theory and its practice. Nonetheless, this relationship needs to be improved, and doing so is an important direction for research in the future. The ...
详细信息
Submission deadline: January 10, 2002The past decade has seen dramatic growth in the application of model checking techniques to the validation and verification of correctness properties of hardware, and more recently...
Submission deadline: January 10, 2002The past decade has seen dramatic growth in the application of model checking techniques to the validation and verification of correctness properties of hardware, and more recently software systems. One of the methods is to model a hardware or software system as a finite, labelled transition system which is then exhaustively explored to decide whether a given temporal specification holds. Recently, there has been increasing interest in applying logicprogramming techniques to model checking in particular and verification in general. For example, table-based logicprogramming can be used as an efficient means of performing explicit model checking. Other research has successfully exploited set-based logic program analysis, constraint logicprogramming, and logic program transformation *** aim of this special issue is to attract high-quality research papers on the interplay between verification techniques (e.g. model checking, reduction and abstraction) and logicprogramming techniques (e.g. constraints, abstract interpretation, program transformation).
Figure 3 was left out in the article (Gottlob et al. 2013). The figure that is given there as figure 3 should in fact be figure 4. Further, the reference to figure 3 on the 4thline of page 889 should be a reference to...
Figure 3 was left out in the article (Gottlob et al. 2013). The figure that is given there as figure 3 should in fact be figure 4. Further, the reference to figure 3 on the 4thline of page 889 should be a reference to figure 4. The correct figure 3 (missing in the paper) is supplied below. We apologise for this error.
Significant advances have recently been made in the area of updates of logic programs, and, more generally, updates of knowledge bases and their applications. Accordingly, the journal theory and practice of logic Prog...
Significant advances have recently been made in the area of updates of logic programs, and, more generally, updates of knowledge bases and their applications. Accordingly, the journal theory and practice of logic programming has planned a special issue on Change in Knowledge Bases, tentatively scheduled to appear at the beginning of ***-quality papers are sought containing either original research results or offering an insightful synthesis of past work on various aspects of change in knowledge *** and enhanced versions of papers published in conference proceedings that have not appeared in archival journals are eligible for submission. Surveys and comparison of state of the art techniques are also solicited.
Functional and logicprogramming are the most important declarative programming paradigms, and interest in combining them has grown over the last decade. Early research concentrated on the definition and improvement o...
Functional and logicprogramming are the most important declarative programming paradigms, and interest in combining them has grown over the last decade. Early research concentrated on the definition and improvement of execution principles for such integrated languages, while more recently efficient implementations of these execution principles have been developed so that these languages became relevant for practical applications. In this paper, we survey the development of the operational semantics as well as the improvement of the implementation of functional logic languages.
A theoretical foundation is presented aimed at reconciling the theory and practice of decision table (DT) processing with a family of relatable methodologies represented by logicprogramming (LP), Prolog, and relation...
详细信息
A theoretical foundation is presented aimed at reconciling the theory and practice of decision table (DT) processing with a family of relatable methodologies represented by logicprogramming (LP), Prolog, and relational databases. Implementations with predicate data organizations adhere to the relational definition of DT's and illustrate the impact of relational level processing on DT processing;interconnections among these implementations are also stipulated. Use and performance characteristics for the various methods are mentioned and, in order to highlight the contributions to DT theory and methodology, the attractiveness of the perspectives gained from LP is summarized and demonstrated.
In this paper, we describe the research lines in logicprogramming, carried out in Cosenza over a period of more than 20 years, which have recently produced promising industrial exploitation follow-ups. The research l...
详细信息
In this paper, we describe the research lines in logicprogramming, carried out in Cosenza over a period of more than 20 years, which have recently produced promising industrial exploitation follow-ups. The research lines have changed over the time but they have kept the initial interest on combining logicprogramming with databases techniques, that has been continuously renewed to cope with new challenges, in our attempt to use theory to solve practical problems.
Answer set programming (ASP) is a method for solving hard problems using computational logic. We describe a problem as a set of formulas of a declarative logical language in such way that the solutions correspond to t...
Answer set programming (ASP) is a method for solving hard problems using computational logic. We describe a problem as a set of formulas of a declarative logical language in such way that the solutions correspond to the models (answer sets) of the set and then use a general-purpose inference engine to find the answer sets.
In this work we define an ASP language, cardinality constraint programs (CCP). The language extends normal logic programs by adding cardinality and conditional literals as well as choice rules. These extensions allow us to represent many if not most NP-complete problems in a concise and intuitive way. The language is defined in two phases where we first introduce a simple basic language and then define the constructs of the full language in terms of translations to the basic language.
The language has a declarative formal semantics that is based on the stable model semantics of normal logic programs. The semantics of a program with variables is defined via its ground instantiation. In addition of using the Herbrand instantiation a program can be instantiated with respect to some other universe, which makes it possible to have a direct support for interpreted functions in the semantics.
The semantics is undecidable in the general case. We identify a syntactic subclass of CCPs, namely omega-restricted programs, that are decidable even when function symbols are allowed. The stable models of such programs are created by a finite relevant instantiation that we can always compute. We analyze the computational complexity of omega-restricted programs and show that deciding whether a program has a stable model is 2-NEXP-complete. We identify further subclasses of programs that are NP- and NEXP-complete in the same sense. We also present an algorithm for instantiating omega-restricted programs.
We discuss programming methodology and show how we can create uniform CCP encodings for different problems using the generate-and-test methodology. We examine ho
Functional and logicprogramming are the most important declarative programming paradigms, and interest in combining them has grown over the last decade. Early research concentrated on the definition and improvement o...
详细信息
Functional and logicprogramming are the most important declarative programming paradigms, and interest in combining them has grown over the last decade. Early research concentrated on the definition and improvement of execution principles for such integrated languages, while more recently efficient implementations of these execution principles have been developed so that these languages became relevant for practical applications. In this paper, we survey the development of the operational semantics as well as the improvement of the implementation of functional logic languages.
暂无评论