The Semantics of Predicate Logic as a Programming Language

General topics in the theory of software (68N01) Formal languages and automata (68Q45) Pattern recognition, speech recognition (68T10) Classical first-order logic (03B10)

Cited In (only showing first 100 items - show all)

Closures and fairness in the semantics of programming logic
Equational properties of stratified least fixed points (extended abstract)
Causal graph justifications of logic programs
Uniform semantic treatment of default and autoepistemic logics
Uniform closures: Order-theoretically reconstructing logic program semantics and abstract domain refinements
Semantics of Horn and disjunctive logic programs
Logic programming with sets
A declarative approach for first-order built-in's of Prolog
A new framework for declarative programming
A superposition oriented theorem prover
Optimal fixedpoints of logic programs
Compiling problem specifications into SAT
AND parallelism and nondeterminism in logic programs
Contributions to the semantics of logic perpetual processes
Inferring negative information from disjunctive databases
The fuzzy logic programming language FASILL: design and implementation
Semantic models for concurrent logic languages
How complicated is the set of stable models of a recursive logic program?
Compositional model-theoretic semantics for logic programs
Multi-valued logic programming semantics An algebraic approach
Proofs as computations in linear logic
A fixed point theorem for non-monotonic functions
The alternating fixpoint of logic programs with negation
Disjunctive \(LP+\) integrity constraints = stable model semantics.
Twelve Definitions of a Stable Model
Partial models and logic programming
Abductive logic programming agents with destructive databases
Approximation fixpoint theory and the well-founded semantics of higher-order logic programs
Horn equational theories and paramodulation
Inductive equivalence in clausal logic and nonmonotonic logic programming
Evaluating epistemic negation in answer set programming
Loop-separable programs and their first-order definability
Automatic synthesis of logical models for order-sorted first-order theories
Weak generalized closed world assumption
Multimodal logic programming
Unique satisfiability of Horn sets can be solved in nearly linear time
Paraconsistent logic programming
A three-valued semantics for deductive databases and logic programs
Propositional circumscription and extended closed-world reasoning are \(\Pi_ 2^ P\)-complete
Disjunctive Programs with Set Constraints
Title not available (Why is that?)
Querying logical databases
On the algebraic structure of declarative programming languages
Semantics of structured normal logic programs
Knowledge compilation of logic programs using approximation fixpoint theory
Dynamic graph models
Parallel complexity of logical query programs
Possible worlds and resources: The semantics of \(\mathbf{BI}\)
Combining explicit negation and negation by failure via Belnap's logic
The reduced relative power operation on abstract domains
A compositional semantics for logic programs
On logical constraints in logic programming
Uniform proofs as a foundation for logic programming
Declarative modeling of the operational behavior of logic languages
Linearisability on Datalog programs
On the relationship between circumscription and negation as failure
Nonrecursive incremental evaluation of Datalog queries
Hyperequivalence of logic programs with respect to supported models
A game semantics for disjunctive logic programming
Strong and uniform equivalence of nonmonotonic theories -- an algebraic approach
Reasoning with models
FLP answer set semantics without circular justifications for general logic programs
Negation in rule-based database languages: A survey
Ultimate approximation and its application in nonmonotonic knowledge representation systems
Logic programming and knowledge representation---The A-Prolog perspective
Nondeterminism and infinite computations in constraint programming
Backdoors to normality for disjunctive logic programs
Logic programming with solution preferences
Termination of logic programs with imperfect information: applications and query procedure
Abstract interpretation of resolution-based semantics
Kernel-LEAF: A logic plus functional language
Thirteen Definitions of a Stable Model
Fixpoint semantics for logic programming a survey
Structure identification in relational data
A formal theory of justifications
Quantitative Logic Programming Revisited
Fully abstract compositional semantics for an algebra of logic programs
Argument reduction by factoring
Bottom-up evaluation and query optimization of well-founded models
Abstract interpretation: a kind of magic
Reusing and modifying rulebases by predicate substitution
Recursively indefinite databases
Negation by default and unstratifiable logic programs
Recursive queries and context-free graph grammars
Logic programming in tensor spaces
Semantics of infinite tree logic programming
Freeness in classes without equality
On the autoepistemic reconstruction of logic programming
Programming in three-valued logic
A typed resolution principle for deduction with conditional typing theory
Logic programs with abstract constraint atoms: the role of computations
Some (in)translatability results for normal logic programs and propositional theories
Horn clause programs with polymorphic types: Semantics and resolution
An alternative approach to the semantics of disjunctive logic programs and deductive databases
The expressiveness of locally stratified programs
A semantics for \(\lambda \)Prolog
Formalizing a logic for logic programming
The generalized counting method for recursive logic queries
Intuitionistic three-valued logic and logic programming
Conceptual logic programs

This page was built for publication: The Semantics of Predicate Logic as a Programming Language

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4107888)