scientific article; zbMATH DE number 193539
zbMATH Open0646.68004MaRDI QIDQ4040341FDOQ4040341
Authors: Peter Padawitz 
Publication date: 5 June 1993
Title of this publication is not available (Why is that?)
Recommendations
- Semantical and computational aspects of Horn approximations
- scientific article; zbMATH DE number 4085614
- Computing intersections of Horn theories for reasoning with models
- Publication:4205083
- Semantics of Horn and disjunctive logic programs
- scientific article; zbMATH DE number 2090546
- scientific article; zbMATH DE number 4160108
- Automated Deduction – CADE-20
- Deterministic and nondeterministic computation, and horn programs, on abstract data types
- Publication:4720780
denotational semanticsrecursion theorynarrowingparamodulationChurch-Rosser propertysequent logicgoal reductionmany-sorted Horn logic with equality
Research exposition (monographs, survey articles) pertaining to computer science (68-02) Specification and verification (program logics, model checking, etc.) (68Q60) Classical first-order logic (03B10) Abstract data types; algebraic specification (68Q65)
Cited In (35)
- Knuth-bendix completion of horn clause programs for restricted linear resolution and paramodulation
- Logic programs with equational type specifications
- Incremental constraint satisfaction for equational logic programming
- Horn clause programs with polymorphic types: Semantics and resolution
- Three views on dependency covers from an FCA perspective
- Conditional narrowing modulo a set of equations
- Operational semantics of resolution and productivity in Horn clause logic
- Generic induction proofs
- Smallest horn clause programs
- Deterministic and nondeterministic computation, and horn programs, on abstract data types
- A hybrid programming scheme combining fuzzy-logic and functional-logic resources
- An integrated framework for the diagnosis and correction of rule-based programs
- Title not available (Why is that?)
- Implicit induction in conditional theories
- An access control language based on term rewriting and description logic
- Detecting redundant narrowing derivations by the LSE-SL reducibility test
- Completion-time optimization of rewrite-time goal solving
- Reasoning with conditional axioms
- Contextual rewriting as a sound and complete proof method for conditional LOG-specifications
- Equivalence and difference between institutions: simulating Horn Clause Logic with based algebras
- Swinging types=functions+relations+transition systems
- Observational proofs by rewriting.
- Jungle rewriting: an abstract description of a lazy narrowing machine
- Shallow confluence of conditional term rewriting systems
- Conditional equational theories and complete sets of transformations
- Functorial theory of parameterized specifications in a general specification framework
- Title not available (Why is that?)
- A proof system for conditional algebraic specifications
- Functional Logic Programming: From Theory to Curry
- Mechanizable inductive proofs for a class of \(\forall \exists\) formulas
- A debugging scheme for functional logic programs
- Relating CASL with other specification languages: the institution level.
- An optimal narrowing strategy for general canonical systems
- Expander2: program verification between interaction and automation
- Proving semantical equivalence of data specifications
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4040341)
