Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Complexity Results for Probabilistic Datalog

From MaRDI portal
Publication:4576254
Jump to:navigation, search

DOI10.3233/978-1-61499-672-9-1414zbMath1403.68050OpenAlexW2427659690MaRDI QIDQ4576254

İsmail İlkan Ceylan, Thomas Lukasiewicz, Rafael Peñaloza

Publication date: 12 July 2018

Full work available at URL: http://dx.doi.org/10.3233/978-1-61499-672-9-1414



Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Database theory (68P15) Logic programming (68N17)


Related Items (4)

A Tutorial on Query Answering and Reasoning over Probabilistic Knowledge Bases ⋮ The joy of probabilistic answer set programming: semantics, complexity, expressivity, inference ⋮ Open-world probabilistic databases: semantics, algorithms, complexity ⋮ Complexity results for probabilistic answer set programming


Uses Software

  • PRISM
  • ProbLog
  • YAGO
  • Datalog
  • ProBase





This page was built for publication: Complexity Results for Probabilistic Datalog

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4576254&oldid=18714316"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 7 February 2024, at 12:06.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki