Results 1 to 10 of about 6,681,112 (349)
Description logic programs: combining logic programs with description logic [PDF]
Proceedings of the twelfth international conference on World Wide Web - WWW '03, 2003 We show how to interoperate, semantically and inferentially, between the leading Semantic Web approaches to rules (RuleML Logic Programs) and ontologies (OWL/DAML+OIL Description Logic) via analyzing their expressive intersection.
Benjamin N. Grosof +3 more
semanticscholar +4 more sources
From Logic to Functional Logic Programs [PDF]
Theory and Practice of Logic Programming, 2022 AbstractLogic programming is a flexible programming paradigm due to the use of predicates without a fixed data flow. To extend logic languages with the compact notation of functional programming, there are various proposals to map evaluable functions into predicates in order to stay in the logic programming framework. Since amalgamated functional logic
Michael Hanus
openalex +3 more sources
Generating Local Search Neighborhood with Synthesized Logic Programs [PDF]
Electronic Proceedings in Theoretical Computer Science, 2019 Local Search meta-heuristics have been proven a viable approach to solve difficult optimization problems. Their performance depends strongly on the search space landscape, as defined by a cost function and the selected neighborhood operators.
Mateusz Ślażyński +2 more
doaj +3 more sources
Modular logic programming [PDF]
ACM Transactions on Programming Languages and Systems, 1994 Modularity is a key issue in the design of modern programming languages. When designing modular features for declarative languages in general, and for logic programming languages in particular, the challenge lies in avoiding the superimposition of a complex syntactic and semantic structure over the simple structure of the basic language.
Antonio Brogi +3 more
openalex +3 more sources
Coalgebraic Semantics for Probabilistic Logic Programming [PDF]
Logical Methods in Computer Science, 2021 Probabilistic logic programming is increasingly important in artificial intelligence and related fields as a formalism to reason about uncertainty. It generalises logic programming with the possibility of annotating clauses with probabilities. This paper
Tao Gu, Fabio Zanasi
doaj +1 more source
Transforming Coroutining Logic Programs into Equivalent CHR Programs [PDF]
Electronic Proceedings in Theoretical Computer Science, 2017 We extend a technique called Compiling Control. The technique transforms coroutining logic programs into logic programs that, when executed under the standard left-to-right selection rule (and not using any delay features) have the same computational ...
Vincent Nys, Danny De Schreye
doaj +1 more source
Extensional Semantics for Higher-Order Logic Programs with Negation [PDF]
Logical Methods in Computer Science, 2018 We develop an extensional semantics for higher-order logic programs with negation, generalizing the technique that was introduced in [Bezem99,Bezem01] for positive higher-order programs.
Panos Rondogiannis, Ioanna Symeonidou
doaj +1 more source
Epistemic Logic Programs: A Different World View [PDF]
Electronic Proceedings in Theoretical Computer Science, 2019 Epistemic Logic Programs (ELPs), an extension of Answer Set Programming (ASP) with epistemic operators, have received renewed attention from the research community in recent years.
Michael Morak
doaj +1 more source
Structure learning of probabilistic logic programs by searching the clause space [PDF]
Theory and Practice of Logic Programming, 2013 Learning probabilistic logic programming languages is receiving an increasing attention, and systems are available for learning the parameters (PRISM, LeProbLog, LFI-ProbLog and EMBLEM) or both structure and parameters (SEM-CP-logic and SLIPCASE) of ...
Elena Bellodi, Fabrizio Riguzzi
semanticscholar +1 more source
Programming in logic without logic programming [PDF]
Theory and Practice of Logic Programming, 2016 AbstractIn previous work, we proposed a logic-based framework in which computation is the execution of actions in an attempt to make reactive rules of the formif antecedent then consequenttrue in a canonical model of a logic program determined by an initial state, sequence of events, and the resulting sequence of subsequent states.
KOWALSKI, R, SADRI, F
openaire +4 more sources