Pages that link to "Item:Q913530"

The following pages link to Declarative modeling of the operational behavior of logic languages (Q913530):

Displaying 43 items.

• An integrated framework for the diagnosis and correction of rule-based programs (Q604477) (← links)
• Nondeterminism and infinite computations in constraint programming (Q671989) (← links)
• Fully abstract compositional semantics for an algebra of logic programs (Q672703) (← links)
• Efficient bottom-up execution of logic programs using abstract interpretation (Q689638) (← links)
• Is there an axiomatic semantics for standard pure Prolog? (Q805224) (← links)
• Comparative semantics for flow of control in logic programming without logic (Q805247) (← links)
• Reactive systems, (semi-)saturated semantics and coalgebras on presheaves (Q843097) (← links)
• A new generic scheme for functional logic programming with constraints (Q880985) (← links)
• Finite failures and partial computations in concurrent logic languages (Q915476) (← links)
• A declarative semantics of flat guarded Horn clauses for programs with perpetual processes (Q915481) (← links)
• A compact fixpoint semantics for term rewriting systems (Q987981) (← links)
• S-semantics for logic programming: a retrospective look (Q1035702) (← links)
• Abstract interpretation of resolution-based semantics (Q1035705) (← links)
• Semantic models for concurrent logic languages (Q1177921) (← links)
• From failure to success: Comparing a denotational and a declarative semantics for Horn clause logic (Q1194328) (← links)
• Unfolding and fixpoint semantics of concurrent constraint logic programs (Q1200981) (← links)
• Compositionality properties of SLD-derivations (Q1274454) (← links)
• Transforming constraint logic programs (Q1274969) (← links)
• Uniform closures: Order-theoretically reconstructing logic program semantics and abstract domain refinements (Q1275821) (← links)
• The reduced relative power operation on abstract domains (Q1285656) (← links)
• A compositional semantics for logic programs (Q1314414) (← links)
• A denotational semantics and dataflow construction for logic programs (Q1318723) (← links)
• Bottom-up abstract interpretation of logic programs (Q1318725) (← links)
• Deriving fold/unfold transformations of logic programs using extended OLDT-based abstract interpretation (Q1322838) (← links)
• A declarative approach for first-order built-in's of Prolog (Q1328181) (← links)
• SLDNF resolution with non-safe rule and fixpoint semantics for general logic programs (Q1350529) (← links)
• Constraint logic programming with dynamic scheduling: A semantics based on closure operators (Q1368380) (← links)
• Institutions for logic programming (Q1391732) (← links)
• Constrained dependencies (Q1391931) (← links)
• A new framework for declarative programming (Q1399960) (← links)
• Type dependencies for logic programs using ACI-unification (Q1575243) (← links)
• An abstract interpretation framework to reason on finite failure and other properties of finite and infinite computations. (Q1853617) (← links)
• A theory of observables for logic programs (Q1854446) (← links)
• On computability by logic programs (Q1924787) (← links)
• The powerset operator on abstract interpretations (Q1960538) (← links)
• Fast offline partial evaluation of logic programs (Q2437798) (← links)
• Declarative Debugging of Functional Logic Programs1 1This work has been partially supported by CICYT under grant TIC2001-2705-C03-01, by Accóon Integrada Hispano-Italiana HI2000-0161 and by Generalitat Valenciana under grant GV01-424. (Q2841221) (← links)
• A Debugging Scheme for Functional Logic Programs1 1This work has been partially supported by CICYT under grant TIC2001-2705-C03-01, by Acción Integrada Hispano-Italiana HI2000-0161, Acción Integrada Hispano-Alemana HA2001-0059 and by Generalitat Valenci (Q2841284) (← links)
• Coalgebraic Semantics for Parallel Derivation Strategies in Logic Programming (Q3067470) (← links)
• Description, Implementation, and Evaluation of a Generic Design for Tabled CLP (Q4957184) (← links)
• Unfolding and fixpoint semantics of concurrent constraint logic programs (Q5096197) (← links)
• Algebraic methods in the compositional analysis of logic programs (Q5096873) (← links)
• On Correctness and Completeness of an <i>n</i> Queens Program (Q6063871) (← links)