scientific article; zbMATH DE number 1142320

Cited in

(81)

My work with Victor Marek: a mathematician looks at answer set programming
Hyperequivalence of logic programs with respect to supported models
Abstract interpretation of resolution-based semantics
Datalog extensions for database queries and updates
Semantic models for concurrent logic languages
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
Generalizing completeness results for loop checks in logic programming
Compositional model-theoretic semantics for logic programs
The expressive power of stratified logic programs with value invention
Logic programs, well-orderings, and forward chaining
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
Undecidable goals for completed acyclic programs
A context for belief revision: forward chaining-normal nonmonotonic rule systems
A declarative approach for first-order built-in's of Prolog
The role of standardising apart in logic programming
Stratified least fixpoint logic
What is failure? An approach to constructive negation
Reasoning about prolog programs: From modes through types to assertions
Revision programming
A unifying view for logic programming with non-monotonic reasoning
On feasible cases of checking multi-agent systems behavior.
Stratified resolution
Loop checking in SLD-derivations by well-quasi-ordering of goals
Approximate reasoning by similarity-based SLD resolution.
Sequent calculi for skeptical reasoning in predicate default logic and other nonmonotonic logics
Integrating induction and abduction in logic programming
Similarity-based SLD resolution and its role for web knowledge discovery
Evolution of rule-based programs
First-order theories for pure Prolog programs with negation
The expressiveness of locally stratified programs
Analogical proportions
Fuzzy lattice operations on first-order terms over signatures with similar constructors: a constraint-based approach
Making sense of sensory input
Making sense of raw input
Totally correct logic program transformations via well-founded annotations
On complexity of verification of interacting agents' behavior
On dual programs in co-logic programming and the Horn \({\mu}\)-calculus
On the preferred extensions of argumentation frameworks: bijections with naive sets
Weakest preconditions for pure Prolog programs
Horn clause solvers for program verification
Fast Offline Partial Evaluation of Large Logic Programs
On Negative Unfolding in the Answer Set Semantics
Program equilibrium -- a program reasoning approach
A game semantics for disjunctive logic programming
Négation constructive et axiomatique interne
Canonical ground Horn theories
Proof-theoretic notions for software maintenance
Probabilistic behaviours of reactive agents
Incremental and modular context-sensitive analysis
Proving termination of general Prolog programs
Verification of logic programs with delay declarations
On logical constraints in logic programming
An abductive framework for extended logic programming
Proximity-based unification theory
On the Continuity of Gelfond-Lifschitz Operator and Other Applications of Proof-Theory in ASP
Relativized Hyperequivalence of Logic Programs for Modular Programming
On dual programs in co-logic programming
Extended term rewriting systems
-Universal termination of logic programs
Fuzzy 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
Verification of compiler correctness for the WAM
Fully abstract compositional semantics for an algebra of logic programs
Annotated nonmonotonic rule systems
Transition system specifications with negative premises
Generalization-based similarity
Logic program proportions
Some properties of substitutions in the framework of similarity relations
A sound and complete semantics for a similarity-based logic programming language
Strict completion of logic programs
Combining probabilistic logic programming with the power of maximum entropy
Derivation of efficient logic programs by specialization and reduction of nondeterminism
Reasoning under minimal upper bounds in propositional logic
A new generic scheme for functional logic programming with constraints
Logic programs with abstract constraint atoms: the role of computations

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 Q4385536)