73 Search Results for "Saeedloei, Neda"

Volume

OASIcs, Volume 64

Technical Communications of the 34th International Conference on Logic Programming (ICLP 2018)

ICLP 2018, July 14-17, 2018, Oxford, United Kingdom

Editors: Alessandro Dal Palu', Paul Tarau, Neda Saeedloei, and Paul Fodor

Volume

OASIcs, Volume 58

Technical Communications of the 33rd International Conference on Logic Programming (ICLP 2017)

ICLP 2017, August 28 to September 1, 2017, Melbourne, Australia

Editors: Ricardo Rocha, Tran Cao Son, Christopher Mears, and Neda Saeedloei

Volume

OASIcs, Volume 52

Technical Communications of the 32nd International Conference on Logic Programming (ICLP 2016)

ICLP 2016 TCs, October 16-21, 2016, New York City, USA

Editors: Manuel Carro, Andy King, Neda Saeedloei, and Marina De Vos

Document
Complete Volume
DOI: 10.4230/OASIcs.ICLP.2018
OASIcs, Volume 64, ICLP'18, Complete Volume

Authors: Alessandro Dal Palu', Paul Tarau, Neda Saeedloei, and Paul Fodor

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

Abstract
OASIcs, Volume 64, ICLP'18, Complete Volume
Cite as

Alessandro Dal Palu', Paul Tarau, Neda Saeedloei, and Paul Fodor. OASIcs, Volume 64, ICLP'18, Complete Volume. In Technical Communications of the 34th International Conference on Logic Programming (ICLP 2018). Open Access Series in Informatics (OASIcs), Volume 64, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)

Copy BibTex To Clipboard

@Proceedings{dalpalu_et_al:OASIcs.ICLP.2018,
  title =	{{OASIcs, Volume 64, ICLP'18, Complete Volume}},
  booktitle =	{Technical Communications of the 34th International Conference on Logic Programming (ICLP 2018)},
  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.dagstuhl.de/entities/document/10.4230/OASIcs.ICLP.2018},
  URN =		{urn:nbn:de:0030-drops-98979},
  doi =		{10.4230/OASIcs.ICLP.2018},
  annote =	{Keywords: Software and its engineering, Constraint and logic languages, Theory of computation, Logic, Constraint and logic programming}
}
Document
Front Matter
DOI: 10.4230/OASIcs.ICLP.2018.0
Front Matter, Table of Contents, Preface, Conference Organization

Authors: Alessandro Dal Palu', Paul Tarau, Neda Saeedloei, and Paul Fodor

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

Abstract
Front Matter, Table of Contents, Preface, Conference Organization
Cite as

Alessandro Dal Palu', Paul Tarau, Neda Saeedloei, and Paul Fodor. Front Matter, Table of Contents, Preface, Conference Organization. In Technical Communications of the 34th International Conference on Logic Programming (ICLP 2018). Open Access Series in Informatics (OASIcs), Volume 64, pp. 0:i-0:x, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)

Copy BibTex To Clipboard

@InProceedings{dalpalu_et_al:OASIcs.ICLP.2018.0,
  author =	{Dal Palu', Alessandro and Tarau, Paul and Saeedloei, Neda and Fodor, Paul},
  title =	{{Front Matter, Table of Contents, Preface, Conference Organization}},
  booktitle =	{Technical Communications of the 34th International Conference on Logic Programming (ICLP 2018)},
  pages =	{0:i--0:x},
  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.dagstuhl.de/entities/document/10.4230/OASIcs.ICLP.2018.0},
  URN =		{urn:nbn:de:0030-drops-98669},
  doi =		{10.4230/OASIcs.ICLP.2018.0},
  annote =	{Keywords: Front Matter, Table of Contents, Preface, Conference Organization}
}
Document
DOI: 10.4230/OASIcs.ICLP.2018.1
Epistemic Logic Programs with World View Constraints

Authors: Patrick Thor Kahl and Anthony P. Leclerc

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

Abstract
An epistemic logic program is a set of rules written in the language of Epistemic Specifications, an extension of the language of answer set programming that provides for more powerful introspective reasoning through the use of modal operators K and M. We propose adding a new construct to Epistemic Specifications called a world view constraint that provides a universal device for expressing global constraints in the various versions of the language. We further propose the use of subjective literals (literals preceded by K or M) in rule heads as syntactic sugar for world view constraints. Additionally, we provide an algorithm for finding the world views of such programs.
Cite as

Patrick Thor Kahl and Anthony P. Leclerc. Epistemic Logic Programs with World View Constraints. In Technical Communications of the 34th International Conference on Logic Programming (ICLP 2018). Open Access Series in Informatics (OASIcs), Volume 64, pp. 1:1-1:17, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)

Copy BibTex To Clipboard

@InProceedings{kahl_et_al:OASIcs.ICLP.2018.1,
  author =	{Kahl, Patrick Thor and Leclerc, Anthony P.},
  title =	{{Epistemic Logic Programs with World View Constraints}},
  booktitle =	{Technical Communications of the 34th International Conference on Logic Programming (ICLP 2018)},
  pages =	{1:1--1:17},
  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.dagstuhl.de/entities/document/10.4230/OASIcs.ICLP.2018.1},
  URN =		{urn:nbn:de:0030-drops-98679},
  doi =		{10.4230/OASIcs.ICLP.2018.1},
  annote =	{Keywords: Epistemic Specifications, Epistemic Logic Programs, Constraints, World View Constraints, World View Rules, WV Facts, Answer Set Programming, Logic Programming}
}
Document
DOI: 10.4230/OASIcs.ICLP.2018.2
Cumulative Scoring-Based Induction of Default Theories

Authors: Farhad Shakerin and Gopal Gupta

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

Abstract
Significant research has been conducted in recent years to extend Inductive Logic Programming (ILP) methods to induce a more expressive class of logic programs such as answer set programs. The methods proposed perform an exhaustive search for the correct hypothesis. Thus, they are sound but not scalable to real-life datasets. Lack of scalability and inability to deal with noisy data in real-life datasets restricts their applicability. In contrast, top-down ILP algorithms such as FOIL, can easily guide the search using heuristics and tolerate noise. They also scale up very well, due to the greedy nature of search for best hypothesis. However, in some cases despite having ample positive and negative examples, heuristics fail to direct the search in the correct direction. In this paper, we introduce the FOLD 2.0 algorithm - an enhanced version of our recently developed algorithm called FOLD. Our original FOLD algorithm automates the inductive learning of default theories. The enhancements presented here preserve the greedy nature of hypothesis search during clause specialization. These enhancements also avoid being stuck in local optima - a major pitfall of FOIL-like algorithms. Experiments that we report in this paper, suggest a significant improvement in terms of accuracy and expressiveness of the class of induced hypotheses. To the best of our knowledge, our FOLD 2.0 algorithm is the first heuristic based, scalable, and noise-resilient ILP system to induce answer set programs.
Cite as

Farhad Shakerin and Gopal Gupta. Cumulative Scoring-Based Induction of Default Theories. In Technical Communications of the 34th International Conference on Logic Programming (ICLP 2018). Open Access Series in Informatics (OASIcs), Volume 64, pp. 2:1-2:15, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)

Copy BibTex To Clipboard

@InProceedings{shakerin_et_al:OASIcs.ICLP.2018.2,
  author =	{Shakerin, Farhad and Gupta, Gopal},
  title =	{{Cumulative Scoring-Based Induction of Default Theories}},
  booktitle =	{Technical Communications of the 34th International Conference on Logic Programming (ICLP 2018)},
  pages =	{2:1--2: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.dagstuhl.de/entities/document/10.4230/OASIcs.ICLP.2018.2},
  URN =		{urn:nbn:de:0030-drops-98685},
  doi =		{10.4230/OASIcs.ICLP.2018.2},
  annote =	{Keywords: Inductive Logic Programming, Negation As Failure, Answer Set Programming, Default reasoning, Machine learning}
}
Document
DOI: 10.4230/OASIcs.ICLP.2018.3
Introspecting Preferences in Answer Set Programming

Authors: Zhizheng Zhang

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

Abstract
This paper develops a logic programming language, ASP^EP, that extends answer set programming language with a new epistemic operator >~_x where x in {#,supseteq}. The operator are used between two literals in rules bodies, and thus allows for the representation of introspections of preferences in the presence of multiple belief sets: G >~_# F expresses that G is preferred to F by the cardinality of the sets, and G >~_supseteq F expresses G is preferred to F by the set-theoretic inclusion. We define the semantics of ASP^EP, explore the relation to the languages of strong introspections, and study the applications of ASP^EP by modeling the Monty Hall problem and the principle of majority.
Cite as

Zhizheng Zhang. Introspecting Preferences in Answer Set Programming. In Technical Communications of the 34th International Conference on Logic Programming (ICLP 2018). Open Access Series in Informatics (OASIcs), Volume 64, pp. 3:1-3:13, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)

Copy BibTex To Clipboard

@InProceedings{zhang:OASIcs.ICLP.2018.3,
  author =	{Zhang, Zhizheng},
  title =	{{Introspecting Preferences in Answer Set Programming}},
  booktitle =	{Technical Communications of the 34th International Conference on Logic Programming (ICLP 2018)},
  pages =	{3:1--3:13},
  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.dagstuhl.de/entities/document/10.4230/OASIcs.ICLP.2018.3},
  URN =		{urn:nbn:de:0030-drops-98694},
  doi =		{10.4230/OASIcs.ICLP.2018.3},
  annote =	{Keywords: Answer Set, Preference, Introspection}
}
Document
DOI: 10.4230/OASIcs.ICLP.2018.4
A New Proof-Theoretical Linear Semantics for CHR

Authors: Igor Stéphan

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

Abstract
Constraint handling rules are a committed-choice language consisting of multiple-heads guarded rules that rewrite constraints into simpler ones until they are solved. We propose a new proof-theoretical declarative linear semantics for Constraint Handling Rules. We demonstrate completeness and soundness of our semantics w.r.t. operational omega_t. semantics. We propose also a translation from this semantics to linear logic.
Cite as

Igor Stéphan. A New Proof-Theoretical Linear Semantics for CHR. In Technical Communications of the 34th International Conference on Logic Programming (ICLP 2018). Open Access Series in Informatics (OASIcs), Volume 64, pp. 4:1-4:17, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)

Copy BibTex To Clipboard

@InProceedings{stephan:OASIcs.ICLP.2018.4,
  author =	{St\'{e}phan, Igor},
  title =	{{A New Proof-Theoretical Linear Semantics for CHR}},
  booktitle =	{Technical Communications of the 34th International Conference on Logic Programming (ICLP 2018)},
  pages =	{4:1--4:17},
  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.dagstuhl.de/entities/document/10.4230/OASIcs.ICLP.2018.4},
  URN =		{urn:nbn:de:0030-drops-98707},
  doi =		{10.4230/OASIcs.ICLP.2018.4},
  annote =	{Keywords: Constraint Handling Rules, Linear Logic}
}
Document
DOI: 10.4230/OASIcs.ICLP.2018.5
CHR^vis: Syntax and Semantics

Authors: Nada Sharaf, Slim Abdennadher, and Thom Frühwirth

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

Abstract
The work in the paper presents an animation extension (CHR^{vis}) to Constraint Handling Rules (CHR). Visualizations have always helped programmers understand data and debug programs. A picture is worth a thousand words. It can help identify where a problem is or show how something works. It can even illustrate a relation that was not clear otherwise. CHR^{vis} aims at embedding animation and visualization features into CHR programs. It thus enables users, while executing programs, to have such executions animated. The paper aims at providing the operational semantics for CHR^{vis}. The correctness of CHR^{vis} programs is also discussed.
Cite as

Nada Sharaf, Slim Abdennadher, and Thom Frühwirth. CHR^vis: Syntax and Semantics. In Technical Communications of the 34th International Conference on Logic Programming (ICLP 2018). Open Access Series in Informatics (OASIcs), Volume 64, pp. 5:1-5:20, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)

Copy BibTex To Clipboard

@InProceedings{sharaf_et_al:OASIcs.ICLP.2018.5,
  author =	{Sharaf, Nada and Abdennadher, Slim and Fr\"{u}hwirth, Thom},
  title =	{{CHR^vis: Syntax and Semantics}},
  booktitle =	{Technical Communications of the 34th International Conference on Logic Programming (ICLP 2018)},
  pages =	{5:1--5:20},
  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.dagstuhl.de/entities/document/10.4230/OASIcs.ICLP.2018.5},
  URN =		{urn:nbn:de:0030-drops-98716},
  doi =		{10.4230/OASIcs.ICLP.2018.5},
  annote =	{Keywords: Constraint Handling Rules, Visualization, Animation}
}
Document
DOI: 10.4230/OASIcs.ICLP.2018.6
Improving Candidate Quality of Probabilistic Logic Models

Authors: Joana Côrte-Real, Anton Dries, Inês Dutra, and Ricardo Rocha

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

Abstract
Many real-world phenomena exhibit both relational structure and uncertainty. Probabilistic Inductive Logic Programming (PILP) uses Inductive Logic Programming (ILP) extended with probabilistic facts to produce meaningful and interpretable models for real-world phenomena. This merge between First Order Logic (FOL) theories and uncertainty makes PILP a very adequate tool for knowledge representation and extraction. However, this flexibility is coupled with a problem (inherited from ILP) of exponential search space growth and so, often, only a subset of all possible models is explored due to limited resources. Furthermore, the probabilistic evaluation of FOL theories, coming from the underlying probabilistic logic language and its solver, is also computationally demanding. This work introduces a prediction-based pruning strategy, which can reduce the search space based on the probabilistic evaluation of models, and a safe pruning criterion, which guarantees that the optimal model is not pruned away, as well as two alternative more aggressive criteria that do not provide this guarantee. Experiments performed using three benchmarks from different areas show that prediction pruning is effective in (i) maintaining predictive accuracy for all criteria and experimental settings; (ii) reducing the execution time when using some of the more aggressive criteria, compared to using no pruning; and (iii) selecting better candidate models in limited resource settings, also when compared to using no pruning.
Cite as

Joana Côrte-Real, Anton Dries, Inês Dutra, and Ricardo Rocha. Improving Candidate Quality of Probabilistic Logic Models. In Technical Communications of the 34th International Conference on Logic Programming (ICLP 2018). Open Access Series in Informatics (OASIcs), Volume 64, pp. 6:1-6:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)

Copy BibTex To Clipboard

@InProceedings{cortereal_et_al:OASIcs.ICLP.2018.6,
  author =	{C\^{o}rte-Real, Joana and Dries, Anton and Dutra, In\^{e}s and Rocha, Ricardo},
  title =	{{Improving Candidate Quality of Probabilistic Logic Models}},
  booktitle =	{Technical Communications of the 34th International Conference on Logic Programming (ICLP 2018)},
  pages =	{6:1--6:14},
  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.dagstuhl.de/entities/document/10.4230/OASIcs.ICLP.2018.6},
  URN =		{urn:nbn:de:0030-drops-98722},
  doi =		{10.4230/OASIcs.ICLP.2018.6},
  annote =	{Keywords: Relational Machine Learning, Probabilistic Inductive Logic Programming, Search Space Pruning, Model Quality, Experiments}
}
Document
DOI: 10.4230/OASIcs.ICLP.2018.7
Towards Incremental and Modular Context-Sensitive Analysis

Authors: Isabel Garcia-Contreras, José F. Morales, and Manuel V. Hermenegildo

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

Abstract
This is an extended abstract of [I. Garcia-Contreras et al., 2018].
Cite as

Isabel Garcia-Contreras, José F. Morales, and Manuel V. Hermenegildo. Towards Incremental and Modular Context-Sensitive Analysis. In Technical Communications of the 34th International Conference on Logic Programming (ICLP 2018). Open Access Series in Informatics (OASIcs), Volume 64, pp. 7:1-7:2, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)

Copy BibTex To Clipboard

@InProceedings{garciacontreras_et_al:OASIcs.ICLP.2018.7,
  author =	{Garcia-Contreras, Isabel and Morales, Jos\'{e} F. and Hermenegildo, Manuel V.},
  title =	{{Towards Incremental and Modular Context-Sensitive Analysis}},
  booktitle =	{Technical Communications of the 34th International Conference on Logic Programming (ICLP 2018)},
  pages =	{7:1--7:2},
  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.dagstuhl.de/entities/document/10.4230/OASIcs.ICLP.2018.7},
  URN =		{urn:nbn:de:0030-drops-98735},
  doi =		{10.4230/OASIcs.ICLP.2018.7},
  annote =	{Keywords: Program Analysis, (Constraint) Logic Programming, Abstract Interpretation, Fixpoint Algorithms, Incremental Analysis, Modular Analysis}
}
Document
DOI: 10.4230/OASIcs.ICLP.2018.8
MASP-Reduce: A Proposal for Distributed Computation of Stable Models

Authors: Federico Igne, Agostino Dovier, and Enrico Pontelli

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

Abstract
There has been an increasing interest in recent years towards the development of efficient solvers for Answer Set Programming (ASP) and towards the application of ASP to solve increasing more challenging problems. In particular, several recent efforts have explored the issue of scalability of ASP solvers when addressing the challenges caused by the need to ground the program before resolution. This paper offers an alternative solution to this challenge, focused on the use of distributed programming techniques to reason about ASP programs whose grounding would be prohibitive for mainstream ASP solvers. The work builds on a proposal of a characterization of answer set solving as a form of non-standard graph coloring. The paper expands this characterization to include syntactic extensions used in modern ASP (e.g., choice rules, weight constraints). We present an implementation of the solver using a distributed programming framework specifically designed to manipulate very large graphs, as provided by Apache Spark, which in turn builds on the MapReduce programming framework. Finally, we provide a few preliminary results obtained from the first prototype implementation of this approach.
Cite as

Federico Igne, Agostino Dovier, and Enrico Pontelli. MASP-Reduce: A Proposal for Distributed Computation of Stable Models. In Technical Communications of the 34th International Conference on Logic Programming (ICLP 2018). Open Access Series in Informatics (OASIcs), Volume 64, pp. 8:1-8:4, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)

Copy BibTex To Clipboard

@InProceedings{igne_et_al:OASIcs.ICLP.2018.8,
  author =	{Igne, Federico and Dovier, Agostino and Pontelli, Enrico},
  title =	{{MASP-Reduce: A Proposal for Distributed Computation of Stable Models}},
  booktitle =	{Technical Communications of the 34th International Conference on Logic Programming (ICLP 2018)},
  pages =	{8:1--8:4},
  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.dagstuhl.de/entities/document/10.4230/OASIcs.ICLP.2018.8},
  URN =		{urn:nbn:de:0030-drops-98749},
  doi =		{10.4230/OASIcs.ICLP.2018.8},
  annote =	{Keywords: ASP solving, Parallelism, Map-reduce}
}
Document
DOI: 10.4230/OASIcs.ICLP.2018.9
Declarative Algorithms in Datalog with Extrema: Their Formal Semantics Simplified

Authors: Carlo Zaniolo, Mohan Yang, Matteo Interlandi, Ariyam Das, Alexander Shkapsky, and Tyson Condie

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

Abstract
Recent advances are making possible the use of aggregates in recursive queries thus enabling the declarative expression classic algorithms and their efficient and scalable implementation. These advances rely the notion of Pre-Mappability (PreM) of constraints that, along with the seminaive-fixpoint operational semantics, guarantees formal non-monotonic semantics for recursive programs with min and max constraints. In this extended abstract, we introduce basic templates to simplify and automate task of proving PreM.
Cite as

Carlo Zaniolo, Mohan Yang, Matteo Interlandi, Ariyam Das, Alexander Shkapsky, and Tyson Condie. Declarative Algorithms in Datalog with Extrema: Their Formal Semantics Simplified. In Technical Communications of the 34th International Conference on Logic Programming (ICLP 2018). Open Access Series in Informatics (OASIcs), Volume 64, pp. 9:1-9:3, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)

Copy BibTex To Clipboard

@InProceedings{zaniolo_et_al:OASIcs.ICLP.2018.9,
  author =	{Zaniolo, Carlo and Yang, Mohan and Interlandi, Matteo and Das, Ariyam and Shkapsky, Alexander and Condie, Tyson},
  title =	{{Declarative Algorithms in Datalog with Extrema: Their Formal Semantics Simplified}},
  booktitle =	{Technical Communications of the 34th International Conference on Logic Programming (ICLP 2018)},
  pages =	{9:1--9:3},
  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.dagstuhl.de/entities/document/10.4230/OASIcs.ICLP.2018.9},
  URN =		{urn:nbn:de:0030-drops-98758},
  doi =		{10.4230/OASIcs.ICLP.2018.9},
  annote =	{Keywords: Recursive Queries}
}
Document
DOI: 10.4230/OASIcs.ICLP.2018.10
Towards Static Performance Guarantees for Programs with Run-Time Checks

Authors: Maximiliano Klemen, Nataliia Stulova, Pedro Lopez-Garcia, José F. Morales, and Manuel V. Hermenegildo

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

Abstract
This document is an extended abstract of the Technical Report CLIP-1/2018.0.
Cite as

Maximiliano Klemen, Nataliia Stulova, Pedro Lopez-Garcia, José F. Morales, and Manuel V. Hermenegildo. Towards Static Performance Guarantees for Programs with Run-Time Checks. In Technical Communications of the 34th International Conference on Logic Programming (ICLP 2018). Open Access Series in Informatics (OASIcs), Volume 64, pp. 10:1-10:2, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)

Copy BibTex To Clipboard

@InProceedings{klemen_et_al:OASIcs.ICLP.2018.10,
  author =	{Klemen, Maximiliano and Stulova, Nataliia and Lopez-Garcia, Pedro and Morales, Jos\'{e} F. and Hermenegildo, Manuel V.},
  title =	{{Towards Static Performance Guarantees for Programs with Run-Time Checks}},
  booktitle =	{Technical Communications of the 34th International Conference on Logic Programming (ICLP 2018)},
  pages =	{10:1--10:2},
  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.dagstuhl.de/entities/document/10.4230/OASIcs.ICLP.2018.10},
  URN =		{urn:nbn:de:0030-drops-98765},
  doi =		{10.4230/OASIcs.ICLP.2018.10},
  annote =	{Keywords: Run-time Checks, Assertions, Abstract Interpretation, Resource Usage Analysis}
}
  • Refine by Author
  • 8 Saeedloei, Neda
  • 3 Gao, Tiantian
  • 3 Gebser, Martin
  • 3 Hermenegildo, Manuel V.
  • 3 Lierler, Yuliya
  • Show More...

  • Refine by Classification
  • 8 Computing methodologies → Logic programming and answer set programming
  • 6 Computing methodologies → Knowledge representation and reasoning
  • 3 Theory of computation → Constraint and logic programming
  • 2 Computing methodologies → Natural language generation
  • 2 Computing methodologies → Natural language processing
  • Show More...

  • Refine by Keyword
  • 11 Answer Set Programming
  • 9 answer set programming
  • 6 Logic Programming
  • 4 Constraints
  • 3 Front Matter
  • Show More...

  • Refine by Type
  • 70 document
  • 3 volume

  • Refine by Publication Year
  • 45 2018
  • 26 2016
  • 2 2010

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 Schloss Dagstuhl - LZI GmbH Imprint Privacy Contact