scientific article; zbMATH DE number 1142320
From MaRDI portal
Publication:4385536
zbMath0900.68136MaRDI QIDQ4385536
Publication date: 14 May 1998
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (77)
Undecidable goals for completed acyclic programs ⋮ A context for belief revision: forward chaining-normal nonmonotonic rule systems ⋮ Extended term rewriting systems ⋮ A declarative approach for first-order built-in's of Prolog ⋮ The role of standardising apart in logic programming ⋮ Stratified least fixpoint logic ⋮ Evolution of rule-based programs ⋮ Weakest preconditions for pure Prolog programs ⋮ On dual programs in co-logic programming and the Horn \({\mu}\)-calculus ⋮ First-order theories for pure Prolog programs with negation ⋮ What is failure? An approach to constructive negation ⋮ Reasoning about prolog programs: From modes through types to assertions ⋮ Analogical proportions ⋮ Reasoning under minimal upper bounds in propositional logic ⋮ Program equilibrium -- a program reasoning approach ⋮ A new generic scheme for functional logic programming with constraints ⋮ The expressiveness of locally stratified programs ⋮ A game semantics for disjunctive logic programming ⋮ Proving termination of general Prolog programs ⋮ Verification of logic programs with delay declarations ⋮ Horn Clause Solvers for Program Verification ⋮ Revision programming ⋮ A unifying view for logic programming with non-monotonic reasoning ⋮ On logical constraints in logic programming ⋮ An abductive framework for extended logic programming ⋮ Lattice point of view for argumentation framework ⋮ Analysis and Transformation of Constrained Horn Clauses for Program Verification ⋮ Reducts of propositional theories, satisfiability relations, and generalizations of semantics of logic programs ⋮ On the preferred extensions of argumentation frameworks: bijections with naive sets ⋮ On feasible cases of checking multi-agent systems behavior. ⋮ Stratified resolution ⋮ Fuzzy lattice operations on first-order terms over signatures with similar constructors: a constraint-based approach ⋮ Datalog extensions for database queries and updates ⋮ Semantic models for concurrent logic languages ⋮ Fully abstract compositional semantics for an algebra of logic programs ⋮ Annotated nonmonotonic rule systems ⋮ Making sense of sensory input ⋮ Making sense of raw input ⋮ How complicated is the set of stable models of a recursive logic program? ⋮ A slight strengthening of a theorem of Blair and Kunen ⋮ From failure to success: Comparing a denotational and a declarative semantics for Horn clause logic ⋮ Transition system specifications with negative premises ⋮ Generalizing completeness results for loop checks in logic programming ⋮ Négation constructive et axiomatique interne ⋮ Canonical Ground Horn Theories ⋮ Proximity-based unification theory ⋮ Compositional model-theoretic semantics for logic programs ⋮ Proof-theoretic notions for software maintenance ⋮ Probabilistic behaviours of reactive agents ⋮ Logic programs with abstract constraint atoms: the role of computations ⋮ On Dual Programs in Co-Logic Programming ⋮ \(\exists\)-Universal termination of logic programs ⋮ Fuzzy logic programming ⋮ Sequent calculi for skeptical reasoning in predicate default logic and other nonmonotonic logics ⋮ Totally correct logic program transformations via well-founded annotations ⋮ On complexity of verification of interacting agents' behavior ⋮ A sound and complete semantics for a similarity-based logic programming language ⋮ Incremental and Modular Context-sensitive Analysis ⋮ Fast Offline Partial Evaluation of Large Logic Programs ⋮ On Negative Unfolding in the Answer Set Semantics ⋮ Strict completion of logic programs ⋮ Integrating induction and abduction in logic programming ⋮ My work with Victor Marek: a mathematician looks at answer set programming ⋮ Hyperequivalence of logic programs with respect to supported models ⋮ The expressive power of stratified logic programs with value invention ⋮ Similarity-based SLD resolution and its role for web knowledge discovery ⋮ Abstract interpretation of resolution-based semantics ⋮ Loop checking in SLD-derivations by well-quasi-ordering of goals ⋮ Logic programs, well-orderings, and forward chaining ⋮ On the Continuity of Gelfond-Lifschitz Operator and Other Applications of Proof-Theory in ASP ⋮ Relativized Hyperequivalence of Logic Programs for Modular Programming ⋮ A compositional semantics for logic programs ⋮ Norms on terms and their use in proving universal termination of a logic program ⋮ Left termination turned into termination ⋮ Approximate reasoning by similarity-based SLD resolution. ⋮ Combining probabilistic logic programming with the power of maximum entropy ⋮ Derivation of efficient logic programs by specialization and reduction of nondeterminism
This page was built for publication:
