AbstractIn this paper, a logic program synthesis method from first-order logic specifications is described. The specifications are describe by Horn clauses extended by universally quantified implicational formulas. These formulas are transformed into definite clause programs by unfold/fold transformation. We show that some classes of first-order formulas can be successfully transformed into definite clauses by unfold/fold transformation
We present a general strategy for stepwise, sound and progressive synthesis of logic programs from s...
We present a methodology for logic program development based on the use of verified transformation t...
1 Introduction Program synthesis is concerned with deriving programs from their specifications. Suc...
AbstractWe present a method for proving properties of definite logic programs. This method is called...
We show how logical frameworks can provide a basis for logic program synthesis. With them, we may us...
. We present a method for proving properties of definite logic programs. This method is called unfol...
We present a method for proving properties of definite logic programs. This method is called unfold/...
In this paper definite Horn clause programs are investigated within a proof-theoretic framework; pro...
This paper presents an overview and a survey of logic program synthesis. Logic program synthesis is ...
We develop a framework for stepwise synthesis of logic programs from incomplete specifications. Afte...
AbstractThis paper presents an overview and a survey of logic program synthesis. Logic program synth...
Derivation of logic programs from first-order logic specifications is nontrivial and tends to be don...
This paper presents an overview and a survey of logic program synthesis. Logic program synthesis is ...
This paper discusses the generalization of definite Horn programs beyond the ordering of logical imp...
We describe a system for the synthesis of logic programs from specifications based on higher-order l...
We present a general strategy for stepwise, sound and progressive synthesis of logic programs from s...
We present a methodology for logic program development based on the use of verified transformation t...
1 Introduction Program synthesis is concerned with deriving programs from their specifications. Suc...
AbstractWe present a method for proving properties of definite logic programs. This method is called...
We show how logical frameworks can provide a basis for logic program synthesis. With them, we may us...
. We present a method for proving properties of definite logic programs. This method is called unfol...
We present a method for proving properties of definite logic programs. This method is called unfold/...
In this paper definite Horn clause programs are investigated within a proof-theoretic framework; pro...
This paper presents an overview and a survey of logic program synthesis. Logic program synthesis is ...
We develop a framework for stepwise synthesis of logic programs from incomplete specifications. Afte...
AbstractThis paper presents an overview and a survey of logic program synthesis. Logic program synth...
Derivation of logic programs from first-order logic specifications is nontrivial and tends to be don...
This paper presents an overview and a survey of logic program synthesis. Logic program synthesis is ...
This paper discusses the generalization of definite Horn programs beyond the ordering of logical imp...
We describe a system for the synthesis of logic programs from specifications based on higher-order l...
We present a general strategy for stepwise, sound and progressive synthesis of logic programs from s...
We present a methodology for logic program development based on the use of verified transformation t...
1 Introduction Program synthesis is concerned with deriving programs from their specifications. Suc...
DOI
Add to ORKG