Zobrazeno 1 - 10
of 33
pro vyhledávání: '"Angelos Charalambidis"'
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 191, Iss Proc. FICS 2015, Pp 18-32 (2015)
Two distinct research approaches have been proposed for assigning a purely extensional semantics to higher-order logic programming. The former approach uses classical domain theoretic tools while the latter builds on a fixed-point construction define
Externí odkaz:
https://doaj.org/article/2508c3dcb2f64e4c9ec95270a8859106
Logic Programs with Ordered Disjunction (LPODs) extend classical logic programs with the capability of expressing preferential disjunctions in the heads of program rules. The initial semantics of LPODs, although simple and quite intuitive, is not pur
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::6dafc500879661a45680d72ea3fde3d9
Publikováno v:
Theory and Practice of Logic Programming. 19:925-940
A classical result in descriptive complexity theory states that Datalog expresses exactly the class of polynomially computable queries on ordered databases. In this paper we extend this result to the case of higher-order Datalog. In particular, we de
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::81aa1926d613bfbd5e77ecee58d4824e
https://doi.org/10.1017/s1471068419000279
https://doi.org/10.1017/s1471068419000279
Logic Programs with Ordered Disjunction (LPODs) extend classical logic programs with the capability of expressing alternatives with decreasing degrees of preference in the heads of program rules. Despite the fact that the operational meaning of order
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c32f518e209ca6f052c929a8dac238ab
Publikováno v:
LICS
We introduce the notion of a lexicographic lattice structure, namely a lattice whose elements can be viewed as stratified entities and whose ordering relation compares elements in a lexicographic manner with respect to their strata. These lattices ar
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f9efa38b847b51030174f50a257fb8df
https://doi.org/10.1145/3373718.3394797
https://doi.org/10.1145/3373718.3394797
Publikováno v:
PPDP
We consider the problem of concisely representing and handling preferences in logic programming and relational databases. Our starting point is the well-known proposal developed in [2] which advocates the embedding of first-order preference formulas
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a6cbc9c0fc33a4ade769398aa3fd26fd
https://doi.org/10.1016/j.scico.2017.09.002
https://doi.org/10.1016/j.scico.2017.09.002
Publikováno v:
Acta Cybernetica. 23:319-326
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::02f740960730728b0342f98213963b7d
https://doi.org/10.14232/actacyb.23.1.2017.17
https://doi.org/10.14232/actacyb.23.1.2017.17
Publikováno v:
Logic-Based Program Synthesis and Transformation ISBN: 9783030138370
LOPSTR
LOPSTR
Higher-order logic programming is an interesting extension of traditional logic programming that allows predicates to appear as arguments and variables to be used where predicates typically occur. Higher-order characteristics are indeed desirable but
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::416a2ea3ed99acb09a345f6891457d19
https://doi.org/10.1007/978-3-030-13838-7_8
https://doi.org/10.1007/978-3-030-13838-7_8
Publikováno v:
REBLS@SPLASH
Robotics and IoT applications are perfect candidates that can benefit from the functional reactive programming paradigm. Moreover, since a typical program can be represented as a dataflow graph, the application can be conceptually separated and distr
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f5fb11e54b4bed3342af33c077bac3d0
https://doi.org/10.1145/3281278.3281279
https://doi.org/10.1145/3281278.3281279