3 Search Results for "Vennekens, Joost"

Document
DOI: 10.4230/OASIcs.ICLP.2018.13
Application of Logic-Based Methods to Machine Component Design

Authors: Bram Aerts and Joost Vennekens

Published in: OASIcs, Volume 64, Technical Communications of the 34th International Conference on Logic Programming (ICLP 2018)

Abstract
This paper describes an application worked out in collaboration with a company that produces made-to-order machine components. The goal of the project is to develop a system that can support the company's engineers by automating parts of their component design process. We propose a knowledge extraction methodology based on the recent DMN (Decision Model and Notation) standard and compare a rule-based and a constraint-based method for representing the resulting knowledge. We study the advantages and disadvantages of both approaches in the context of the company's real-life application.
Cite as

Bram Aerts and Joost Vennekens. Application of Logic-Based Methods to Machine Component Design. In Technical Communications of the 34th International Conference on Logic Programming (ICLP 2018). Open Access Series in Informatics (OASIcs), Volume 64, pp. 13:1-13:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)

Copy BibTex To Clipboard

@InProceedings{aerts_et_al:OASIcs.ICLP.2018.13,
  author =	{Aerts, Bram and Vennekens, Joost},
  title =	{{Application of Logic-Based Methods to Machine Component Design}},
  booktitle =	{Technical Communications of the 34th International Conference on Logic Programming (ICLP 2018)},
  pages =	{13:1--13:15},
  series =	{Open Access Series in Informatics (OASIcs)},
  ISBN =	{978-3-95977-090-3},
  ISSN =	{2190-6807},
  year =	{2018},
  volume =	{64},
  editor =	{Dal Palu', Alessandro and Tarau, Paul and Saeedloei, Neda and Fodor, Paul},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/OASIcs.ICLP.2018.13},
  URN =		{urn:nbn:de:0030-drops-98798},
  doi =		{10.4230/OASIcs.ICLP.2018.13},
  annote =	{Keywords: Application, Expert Systems, Constraint Solving, Rule-based Systems, Decision Modelling, DMN, Product Configuration}
}
Document
DOI: 10.4230/LIPIcs.ICLP.2012.277
A Tarskian Informal Semantics for Answer Set Programming

Authors: Marc Denecker, Yuliya Lierler, Miroslaw Truszczynski, and Joost Vennekens

Published in: LIPIcs, Volume 17, Technical Communications of the 28th International Conference on Logic Programming (ICLP'12) (2012)

Abstract
In their seminal papers on stable model semantics, Gelfond and Lifschitz introduced ASP by casting programs as epistemic theories, in which rules represent statements about the knowledge of a rational agent. To the best of our knowledge, theirs is still the only published systematic account of the intuitive meaning of rules and programs under the stable semantics. In current ASP practice, however, we find numerous applications in which rational agents no longer seem to play any role. Therefore, we propose here an alternative explanation of the intuitive meaning of ASP programs, in which they are not viewed as statements about an agent's beliefs, but as objective statements about the world. We argue that this view is more natural for a large part of current ASP practice, in particular the so-called Generate-Define-Test programs.
Cite as

Marc Denecker, Yuliya Lierler, Miroslaw Truszczynski, and Joost Vennekens. A Tarskian Informal Semantics for Answer Set Programming. In Technical Communications of the 28th International Conference on Logic Programming (ICLP'12). Leibniz International Proceedings in Informatics (LIPIcs), Volume 17, pp. 277-289, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2012)

Copy BibTex To Clipboard

@InProceedings{denecker_et_al:LIPIcs.ICLP.2012.277,
  author =	{Denecker, Marc and Lierler, Yuliya and Truszczynski, Miroslaw and Vennekens, Joost},
  title =	{{A Tarskian Informal Semantics for Answer Set Programming}},
  booktitle =	{Technical Communications of the 28th International Conference on Logic Programming (ICLP'12)},
  pages =	{277--289},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-43-9},
  ISSN =	{1868-8969},
  year =	{2012},
  volume =	{17},
  editor =	{Dovier, Agostino and Santos Costa, V{\'\i}tor},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICLP.2012.277},
  URN =		{urn:nbn:de:0030-drops-36295},
  doi =		{10.4230/LIPIcs.ICLP.2012.277},
  annote =	{Keywords: Answer set programming, informal semantics, generate-define-test}
}
Document
DOI: 10.4230/DagSemProc.05171.1
05171 Abstracts Collection – Nonmonotonic Reasoning, Answer Set Programming and Constraints

Authors: Gerhard Brewka, Ilkka Niemelä, Torsten Schaub, Miroslaw Truszczynski, and Joost Vennekens

Published in: Dagstuhl Seminar Proceedings, Volume 5171, Nonmonotonic Reasoning, Answer Set Programming and Constraints (2005)

Abstract
From 24.04.05 to 29.04.05, the Dagstuhl Seminar 05171 ``Nonmonotonic Reasoning, Answer Set Programming and Constraints'' was held in the International Conference and Research Center (IBFI), Schloss Dagstuhl. During the seminar, several participants presented their current research, and ongoing work and open problems were discussed. Abstracts of the presentations given during the seminar as well as abstracts of seminar results and ideas are put together in this paper. The first section describes the seminar topics and goals in general. Links to extended abstracts or full papers are provided, if available.
Cite as

Gerhard Brewka, Ilkka Niemelä, Torsten Schaub, Miroslaw Truszczynski, and Joost Vennekens. 05171 Abstracts Collection – Nonmonotonic Reasoning, Answer Set Programming and Constraints. In Nonmonotonic Reasoning, Answer Set Programming and Constraints. Dagstuhl Seminar Proceedings, Volume 5171, pp. 1-23, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2005)

Copy BibTex To Clipboard

@InProceedings{brewka_et_al:DagSemProc.05171.1,
  author =	{Brewka, Gerhard and Niemel\"{a}, Ilkka and Schaub, Torsten and Truszczynski, Miroslaw and Vennekens, Joost},
  title =	{{05171 Abstracts Collection – Nonmonotonic Reasoning, Answer Set Programming and Constraints}},
  booktitle =	{Nonmonotonic Reasoning, Answer Set Programming and Constraints},
  pages =	{1--23},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2005},
  volume =	{5171},
  editor =	{Gerhard Brewka and Ilkka Niemel\"{a} and Torsten Schaub and Miroslaw Truszczynski},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.05171.1},
  URN =		{urn:nbn:de:0030-drops-2690},
  doi =		{10.4230/DagSemProc.05171.1},
  annote =	{Keywords: Knowledge representation, nonmonotonic reasoning, logic programming, answer-set programming, constraints}
}
  • Refine by Author
  • 3 Vennekens, Joost
  • 2 Truszczynski, Miroslaw
  • 1 Aerts, Bram
  • 1 Brewka, Gerhard
  • 1 Denecker, Marc
  • Show More...

  • Refine by Classification
  • 1 Applied computing → Engineering

  • Refine by Keyword
  • 1 Answer set programming
  • 1 Application
  • 1 Constraint Solving
  • 1 DMN
  • 1 Decision Modelling
  • Show More...

  • Refine by Type
  • 3 document

  • Refine by Publication Year
  • 1 2005
  • 1 2012
  • 1 2018

Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2024 Schloss Dagstuhl – LZI GmbH Imprint Privacy Contact