swMATH13877MaRDI QIDQ25788FDOQ25788
Author name not available (Why is that?)
Official website: http://xsb.sourceforge.net/
Cited In (only showing first 100 items - show all)
- On the complexity analysis of static analyses
- Infinite probability computation by cyclic explanation graphs
- Abduction in well-founded semantics and generalized stable models via tabled dual programs
- Title not available (Why is that?)
- MWeb: a principled framework for modular web rule bases and its semantics
- Two case studies of semantics execution in Maude: CCS and LOTOS
- The limits of fixed-order computation
- Database Support for Data Mining Applications
- Correctness and completeness of logic programs
- Nonmonotonic reasoning: Towards efficient calculi and implementations
- A linear algebraic approach to Datalog evaluation
- Model checking with probabilistic tabled logic programming
- Logic Programming Approach to Automata-Based Decision Procedures
- Title not available (Why is that?)
- Algorithmic power from declarative use of redundant constraints
- Tabling for non-monotonic programming
- Title not available (Why is that?)
- On applying or-parallelism and tabling to logic programs
- Tabled evaluation with delaying for general logic programs
- TELOS
- GeneSyst
- HiLog
- LUPS
- Smodels
- DELORES
- clpfd
- Prolog
- Oz
- B-Prolog
- CP-logic
- ProbLog
- PITA
- YAP-Prolog
- Title not available (Why is that?)
- Title not available (Why is that?)
- Mercury
- Terminyzer
- CodeQuest
- Ciao
- CiaoPP
- Konclude
- OpenRuleBench
- SICStus
- JHotDraw
- WebPIE
- NP Datalog
- CAT
- FLORA
- OPTYap
- XASP
- XcelLog
- YapOr
- YapTab
- LOTOSphere
- go
- About epistemic negation and world views in epistemic logic programs
- Well–definedness and efficient inference for probabilistic logic programming under the distribution semantics
- PRISM
- GHC
- MWeb
- PrASP
- Datalog
- miniKanren
- CHR
- SWI-Prolog
- SLING
- cplint
- IDP3
- PARLOG
- BigDatalog
- LPaaS
- Yedalog
- MSO_Regex_Equivalence
- EmptyHeaded
- Stanza
- RDFox
- Hexlite
- Deductive Spreadsheets Using Tabled Logic Programming
- FASILL
- Pushing Efficient Evaluation of HEX Programs by Modular Decomposition
- Flix
- 2P-Kt
- tuProlog
- TuCSoN
- TuSoW
- Logic programming approach to automata-based decision procedures
- Title not available (Why is that?)
- Efficient top-down computation of queries under the well-founded semantics
- A framework for modular ERDF ontologies
- Terminating evaluation of logic programs with finite three-valued models
- Scaling-up reasoning and advanced analytics on BigData
- A three-valued semantics for querying and repairing inconsistent databases
- The PITA system: tabling and answer subsumption for reasoning under uncertainty
- Causal inference in cplint
- Tabling and answer subsumption for reasoning on logic programs with annotated disjunctions
- Linear tabulated resolution based on Prolog control strategy
- Transformation-based bottom-up computation of the well-founded model
- Predicate logic as a modeling language: modeling and solving some machine learning and data mining problems with IDP3
- Euro-Par 2004 Parallel Processing
- Title not available (Why is that?)
This page was built for software: XSB
