The following pages link to The Journal of Logic Programming (Q3030270):
Displaying 50 items.
- On determining the causes of nonunifiability (Q3030271) (← links)
- A completeness theorem for SLDNF resolution (Q3031954) (← links)
- On decompositions of chain datalog programs into P (left-)linear 1-rule components (Q3125088) (← links)
- Evaluation of the domain prop (Q3125089) (← links)
- A language for updating logic programs and its implementation (Q3125091) (← links)
- Negation and minimality in disjunctive databases (Q3125092) (← links)
- Automata-driven indexing of prolog clauses (Q3125095) (← links)
- Principles and implementation of deductive parsing (Q3125891) (← links)
- A complete axiomatization of a theory with feature and arity constraints (Q3125892) (← links)
- String variable grammar: A logic grammar formalism for the biological language of DNA (Q3125894) (← links)
- Unified logic programming approach to the abduction of plans and intentions in information-seeking dialogues (Q3125896) (← links)
- On the use of advanced logic programming languages in computational linguistics (Q3125897) (← links)
- Efficient top-down computation of queries under the well-founded semantics (Q3125898) (← links)
- On the correctness of unfold/fold transformation of normal and extended logic programs (Q3125899) (← links)
- Analysis of residuating logic programs (Q3125900) (← links)
- Depth-bounded bottom-up evaluation of logic programs (Q3128527) (← links)
- Bottom-up computation of perfect models for disjunctive theories (Q3128528) (← links)
- On specifying database updates (Q3128529) (← links)
- Characterizing logic grammars: A substructural logic approach (Q3128612) (← links)
- Nondeterminism through well-founded choice (Q3128614) (← links)
- Optimizing bottom-up evaluation of constraint queries (Q3128615) (← links)
- Extending negation as failure by abduction: A three-valued stable model semantics (Q3128616) (← links)
- On termination of general logic programs w.R.T. constructive negation (Q3128617) (← links)
- Generalized semantics and abstract interpretation for constraint logic programs (Q3128618) (← links)
- Analyzing logic programs using “prop”-ositional logic programs and a magic wand (Q3128619) (← links)
- SLDR-resolution: Parallelizing structural recursion in logic programs (Q3128621) (← links)
- Undecidable boundedness problems for datalog programs (Q3128622) (← links)
- Scoping constructs in logic programming: Implementation problems and their solution (Q3128624) (← links)
- Constraint logic programming for examination timetabling (Q3128626) (← links)
- The NRL Protocol Analyzer: An Overview (Q3128627) (← links)
- Prolog for structured character description and font design (Q3128629) (← links)
- A tool for developing interactive configuration applications (Q3128631) (← links)
- Intelligent data retrieval in prolog: An illuminating idea (Q3128636) (← links)
- Using logic programming and coroutining for electronic CAD (Q3128638) (← links)
- In Memoriam: Paris C. Kanellakis (Q3129492) (← links)
- Stable models and their computation for logic programming with inheritance and true negation (Q3129493) (← links)
- Cuts and side-effects in and-or parallel Prolog (Q3129494) (← links)
- Matching of bounded set terms in the logic language LDL++ (Q3129496) (← links)
- Completeness of SLDNF-resolution for nonfloundering queries (Q3129497) (← links)
- A fixpoint characterization of abductive logic programs (Q3129498) (← links)
- Optimal groundness analysis using propositional logic (Q3129500) (← links)
- Extending Prolog with nonmonotonic reasoning (Q3129501) (← links)
- Compiling constraints in clp(FD) (Q3129502) (← links)
- Smallest horn clause programs (Q3129505) (← links)
- {log}: A language for programming in logic with finite sets (Q3129506) (← links)
- Amalgamating knowledge bases, III: Algorithms, data structures and query processing (Q3129507) (← links)
- Automatic finite unfolding using well-founded measures (Q3129508) (← links)
- A closer look at declarative interpretations (Q3129509) (← links)
- On the design of a correct freeness analysis for logic programs (Q3129510) (← links)
- A note on semantics of logic programs with equality based on complete sets of E-unifiers (Q3129511) (← links)
