The following pages link to (Q3339245):
Displayed 50 items.
- On reasoning about structural equality in XML: a description logic approach (Q555777) (← links)
- A method for symbolic analysis of security protocols (Q557806) (← links)
- Declarative error diagnosis (Q578894) (← links)
- Fixed point equations with parameters in the projective model (Q580971) (← links)
- Temporal logic programming (Q582280) (← links)
- A geometric interpretation of LD-resolution (Q596040) (← links)
- A note on the model-theoretic semantics of fuzzy logic programming for dealing with inconsistency (Q598579) (← links)
- Three-valued completion for abductive logic programs (Q671511) (← links)
- An algebraic formulation of the aggregative closure query (Q671641) (← links)
- Transformations of CLP modules (Q671648) (← links)
- A non-ground realization of the stable and well-founded semantics (Q671655) (← links)
- Lazy narrowing: strong completeness and eager variable elimination (Q671677) (← links)
- Nondeterminism and infinite computations in constraint programming (Q671989) (← links)
- Computing minimal models by partial instantiation (Q672131) (← links)
- Fully abstract compositional semantics for an algebra of logic programs (Q672703) (← links)
- Contributions to the stable model semantics of logic programs with negation (Q672705) (← links)
- Bottom-up evaluation and query optimization of well-founded models (Q673130) (← links)
- Argument reduction by factoring (Q673140) (← links)
- Multi-valued logic programming semantics An algebraic approach (Q673383) (← links)
- Unfolding--definition--folding, in this order, for avoiding unnecessary variables in logic programs (Q673496) (← links)
- Abstract interpretation: a kind of magic (Q673498) (← links)
- Towards a mathematical theory of machine discovery from facts (Q674404) (← links)
- An alternative linear semantics for allowed logic programs (Q676306) (← links)
- Virtual time and virtual space (Q685231) (← links)
- Removing redundancy from a clause (Q685346) (← links)
- Skeptical reason maintenance and belief revision (Q685347) (← links)
- Proof methods of declarative properties of definite programs (Q685395) (← links)
- Graph rewriting for a partial ordering semantics of concurrent constraints programming (Q685459) (← links)
- Hyperedge replacement jungle rewriting for term-rewriting systems and logic programming (Q685465) (← links)
- Semantics and properties of existential quantifiers in deductive databases (Q685471) (← links)
- A logic for programming with complex objects (Q686642) (← links)
- The alternating fixpoint of logic programs with negation (Q686646) (← links)
- Theory matrices (for modal logics) using alphabetical monotonicity (Q687154) (← links)
- Parsing as non-Horn deduction (Q688151) (← links)
- A closed-form evaluation for Datalog queries with integer (gap)-order constraints (Q688670) (← links)
- Equality and abductive residua for Horn clauses (Q689280) (← links)
- Legality concepts for three-valued logic programs (Q689286) (← links)
- A class of programs for which \(SLDNF\) resolution and \(NAF\) rule are complete (Q689290) (← links)
- Enhancing global SLS-resolution with loop cutting and tabling mechanisms (Q703484) (← links)
- Making assumptions in the automated derivation (Q707362) (← links)
- Programming in three-valued logic (Q753474) (← links)
- Negation by default and unstratifiable logic programs (Q753501) (← links)
- Subset-equational programming in intelligent decision systems (Q805225) (← links)
- Comparative semantics for flow of control in logic programming without logic (Q805247) (← links)
- Completeness of an improved declarative debugger (Q808236) (← links)
- A relevance restriction strategy for automated deduction (Q814429) (← links)
- A framework for linguistic modelling (Q814582) (← links)
- Reasoning with infinite stable models (Q814596) (← links)
- Order-sorted logic programming with predicate hierarchy (Q814621) (← links)
- Connectionist modal logic: representing modalities in neural networks (Q870254) (← links)