Constructive negation by bottom-up computation of literal answers

Àlvez, Javier; Lucio, Paqui; Orejas, Fernando

doi:10.1145/967900.968194

Cited by 6 publications

(4 citation statements)

References 18 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In this subsection, we will define an functor OP P based on the operational mechanism called BCN introduced in [17] and refined in [1]. For this purpose, we generalize BCN in such a way it parametrically uses any object S ∈ PreTh as an oracle that evaluates (un)satisfability constraint sentences.…”

Section: Operational Semanticsmentioning

confidence: 99%

“…A proper comparison of these two semantics and of others like [5,6] would need experimental work. We have a prototype implementation of BCN [1], but we do not know if the other approaches have been implemented. Anyhow, the pragmatic virtues of the various operational approaches to constructive negation are not a relevant issue in this paper.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

A Functorial Framework for Constraint Normal Logic Programming

Lucio

Orejas

Pasarella

et al. 2008

Appl Categor Struct

View full text Add to dashboard Cite

The semantic constructions and results for definite programs do not extend when dealing with negation. The main problem is related to a well-known problem in the area of algebraic specification: if we fix a constraint domain as a given model, its free extension by means of a set of Horn clauses defining a set of new predicates is semicomputable. However, if the language of the extension is richer than Horn clauses its free extension (if it exists) is not necessarily semicomputable. In this paper we present a framework that allows us to deal with these problems in a novel way. This framework is based on two main ideas: a reformulation of the notion of constraint domain and a functorial presentation of our semantics. In particular, the semantics of a logic program P is defined in terms of three functors: (OP P , ALG P , LOG P ) that apply to constraint domains and provide the operational, the least fixpoint and the logical semantics of P, respectively. To be more concrete, the idea is that the application of OP P to a specific constraint solver provides the operational semantics of P that uses this solver; the application of ALG P to a specific domain provides the least fixpoint of P over this domain; and, the application of LOG P to a theory of constraints provides the logic theory associated to P. In this context, we prove that these three functors are in some sense equivalent. 422 P. Lucio et al.

show abstract

Section: Operational Semanticsmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

A Functorial Framework for Constraint Normal Logic Programming

Lucio

Orejas

Pasarella

et al. 2008

Appl Categor Struct

View full text Add to dashboard Cite

show abstract

“…Alvez, Lucio, and Orejas [3] present an efficient implementation of constructive negation based on Shepherdson's operators. Mosses [4] shows how the use of labels in Structural Operational Semantics can provide simpler and more modular descriptions of programming languages.…”

Section: The Contributed Papersmentioning

confidence: 99%

Editorial message

Mernik

Bryant

2004

Proceedings of the 2004 ACM Symposium on Applied Computing

View full text Add to dashboard Cite

OBJECTIVES OF THE TRACKProgramming languages are programmers' most basic tools. With appropriate programming languages one can drastically reduce the cost of building new applications as well as maintaining existing ones. In the last decades programming languages have made a large shift from procedural and structured programming towards new programming paradigms such as logic, functional and object-oriented programming. The main driving force was and will continue being to better express programmer's ideas. Therefore, research in programming languages is an endless activity and the core of computer science. New language features, new programming paradigms, better compile-time and run-time mechanisms can be foreseen in the future. The PL Track aims at providing researchers and practitioners in the world with opportunities to present their ideas and experience in designing new programming concepts and implementing programming languages.Original papers and implementation reports were invited in all areas of programming languages. These included: compiling techniques, domain-specific languages, formal semantics and syntax, garbage collection, language design and implementations, new programming language ideas and concepts, new programming paradigms, practical experiences with programming languages, program analysis and verification, program generation and transformation, programming languages from all paradigms (agentoriented, aspect-oriented, functional, logic, object-oriented, etc.), and visual programming languages. STATISTICAL INFORMATIONThe response to the call for papers was better than in the previous years. A total of twenty papers were received, representing thirteen countries (). Eight regular papers and one poster paper were accepted after a rigorous reviewing process performed by the program committee and additional reviewers. Thus, the acceptance ratio for the track was 40%. THE CONTRIBUTED PAPERSMichaelson, Hammond, and Serot [1] describe a domain-specific language called FSM-Hume. It is a subset of Hume based on generalized linear bounded automata with statically determinable time and space use.

show abstract

“…In addition, their presence prevents completeness results for more recent techniques like intensional negation [5] and other transformational negation techniques [20,25]. In several computational mechanisms proposed for constructive negation [7,6,11,23,2], local variables force one to deal with universal quantification, which is not easy to compute in an efficient manner. Other logic programming areas where local variables lead to technical problems are related to compilation, memoization, static analysis, program approximation by neural networks etc.…”

Section: Introductionmentioning

confidence: 99%

An Algorithm for Local Variable Elimination in Normal Logic Programs

Àlvez

Lucio

2006

Logic Based Program Synthesis and Transformation

Self Cite

View full text Add to dashboard Cite

Abstract.A variable is local if it occurs in a clause body but not in its head. Local variables appear naturally in practical logic programming, but they complicate several aspects such as negation, compilation, memoization, static analysis, program approximation by neural networks etc. As a consequence, the absence of local variables yields better performance of several tools and is a prerequisite for many technical results. In this paper, we introduce an algorithm that eliminates local variables from a wide proper subclass of normal logic programs. The proposed transformation preserves the Clark-Kunen semantics for normal logic programs.

show abstract

Constructive negation by bottom-up computation of literal answers

Cited by 6 publications

References 18 publications

A Functorial Framework for Constraint Normal Logic Programming

A Functorial Framework for Constraint Normal Logic Programming

Editorial message

An Algorithm for Local Variable Elimination in Normal Logic Programs

Contact Info

Product

Resources

About