{"batchcomplete":"","continue":{"lecontinue":"20260804100004|23833","continue":"-||"},"query":{"logevents":[{"logid":23843,"ns":0,"title":"Inproceedings3476/en","pageid":17284,"logpage":0,"revid":44709,"params":{},"type":"create","action":"create","user":"141.76.60.239","anon":"","timestamp":"2026-08-10T06:12:07Z","comment":"Page created automatically by parser function on page [[Inproceedings3476]]"},{"logid":23842,"ns":0,"title":"Inproceedings3476","pageid":17283,"logpage":17283,"revid":44708,"params":{},"type":"create","action":"create","user":"Lukas Gerlach","timestamp":"2026-08-10T06:12:07Z","comment":"Die Seite wurde neu angelegt: \u201e{{Publikation Erster Autor |ErsterAutorVorname=Juli\u00e1n |ErsterAutorNachname=M\u00e9ndez |FurtherAuthors=Lukas Gerlach; Tobias Wieland; Alex Ivliev; Markus Kr\u00f6tzsch; Raimund Dachselt }} {{Inproceedings |Referiert=1 |Title=Evaluating a Visual Query Tracer and Builder for Learning Declarative Logic Programming |To appear=1 |Year=2026 |Booktitle=VIS 2026 }} {{Publikation Details |Abstract=Nemo Explain Visualizer (nev) is an interactive visual query tracer and bu\u2026\u201c"},{"logid":23841,"ns":6,"title":"Datei:Nev-Short-Paper-VIS-2026.pdf","pageid":17282,"logpage":17282,"revid":44707,"params":{},"type":"create","action":"create","user":"Lukas Gerlach","timestamp":"2026-08-10T06:11:39Z","comment":""},{"logid":23840,"ns":6,"title":"Datei:Nev-Short-Paper-VIS-2026.pdf","pageid":17282,"logpage":17282,"revid":44707,"params":{"img_sha1":"mijv06x3jze94jim5fsd0104welyfpc","img_timestamp":"2026-08-10T06:11:39Z"},"type":"upload","action":"upload","user":"Lukas Gerlach","timestamp":"2026-08-10T06:11:39Z","comment":""},{"logid":23839,"ns":6,"title":"Datei:SR-Concepts2026.pdf","pageid":17281,"logpage":17281,"revid":44698,"params":{},"type":"create","action":"create","user":"Sebastian Rudolph","timestamp":"2026-08-05T00:11:42Z","comment":""},{"logid":23838,"ns":6,"title":"Datei:SR-Concepts2026.pdf","pageid":17281,"logpage":17281,"revid":44698,"params":{"img_sha1":"b7o8rpp489xazzz4q8ypuz1p2zwydmg","img_timestamp":"2026-08-05T00:11:42Z"},"type":"upload","action":"upload","user":"Sebastian Rudolph","timestamp":"2026-08-05T00:11:42Z","comment":""},{"logid":23837,"ns":0,"title":"Inproceedings3475/en","pageid":17280,"logpage":0,"revid":44695,"params":{},"type":"create","action":"create","user":"217.91.109.24","anon":"","timestamp":"2026-08-05T00:09:21Z","comment":"Page created automatically by parser function on page [[Inproceedings3475]]"},{"logid":23836,"ns":0,"title":"Inproceedings3475","pageid":17279,"logpage":17279,"revid":44694,"params":{},"type":"create","action":"create","user":"Sebastian Rudolph","timestamp":"2026-08-05T00:09:21Z","comment":"Die Seite wurde neu angelegt: \u201e{{Publikation Erster Autor |ErsterAutorVorname=Sebastian |ErsterAutorNachname=Rudolph }} {{Inproceedings |Referiert=1 |Title=Pseudo-Closed Family Veri\ufffdfication is NP-Complete (Or: How Claude Helped Tackle Bernhard\u2019s Problem) |To appear=1 |Year=2026 |Booktitle=Conceptual Knowledge Structures |Publisher=Springer |Series=LNCS |Volume=16811 }} {{Publikation Details |Abstract=Every closure operator on a finite set admits a canonical minimum implication bas\u2026\u201c"},{"logid":23835,"ns":6,"title":"Datei:ESWC2026-sparqling-datalog.pdf","pageid":17217,"logpage":17217,"revid":44693,"params":{"img_sha1":"9csweiug8d706t67hk1s4w0rtxklzx3","img_timestamp":"2026-08-04T13:05:07Z"},"type":"upload","action":"overwrite","user":"Alex Ivliev","timestamp":"2026-08-04T13:05:07Z","comment":"Paper titled \"SPARQLing Datalog for Rule-Based Reasoning over Large Knowledge Graphs\" presented at ESWC 2026"},{"logid":23834,"ns":6,"title":"Datei:ESWC2026-sparqling-datalog.pdf","pageid":17217,"logpage":17217,"revid":44692,"params":{"img_sha1":"d8b6ghszpkojejk8vnoz1r0vxfhoy87","img_timestamp":"2026-08-04T13:03:35Z"},"type":"upload","action":"overwrite","user":"Alex Ivliev","timestamp":"2026-08-04T13:03:35Z","comment":"Paper titled \"SPARQLing Datalog for Rule-Based Reasoning over Large Knowledge Graphs\" presented at ESWC 2026"}]}}