Results 101 to 110 of about 125,965 (208)

PrASP Report [PDF]

open access: yesarXiv, 2016
This technical report describes the usage, syntax, semantics and core algorithms of the probabilistic inductive logic programming framework PrASP. PrASP is a research software which integrates non-monotonic reasoning based on Answer Set Programming (ASP), probabilistic inference and parameter learning.
arxiv  

Trace Logic for Inductive Loop Reasoning [PDF]

open access: yesarXiv, 2020
We propose trace logic, an instance of many-sorted first-order logic, to automate the partial correctness verification of programs containing loops. Trace logic generalizes semantics of program locations and captures loop semantics by encoding properties at arbitrary timepoints and loop iterations.
arxiv  

Automatic inference of indexing rules for MEDLINE

open access: yesBMC Bioinformatics, 2008
Background: Indexing is a crucial step in any information retrieval system. In MEDLINE, a widely used database of the biomedical literature, the indexing process involves the selection of Medical Subject Headings in order to describe the subject matter ...
Shooshan Sonya E   +2 more
doaj   +1 more source

The Norwegian legacy of resisting formal grading

open access: yesThe Curriculum Journal, EarlyView.
Abstract Norway has a longstanding tradition of prohibiting formal grading in primary education. This paper traces a century of restrictive grading policies and their associated discourses. Using Bacchi's (2009) What's the Problem Represented to be framework, we present an analysis of the policy documents that have underpinned Norwegian assessment ...
Henning Fjørtoft   +2 more
wiley   +1 more source

On the complexity of some Inductive Logic Programming problems

open access: yesNew Generation Computing, 1997
The bounded ILP-consistency problem for function-free Horn clauses is described as follows. Given a set E+ and E− of function-free ground Horn clauses and an integer k polynomial in E+∪E−, does there exist a function-free Horn clause C with no more than k literais such that C subsumes each element in E+ and C does not subsume any element in E−.
GOTTLOB G   +2 more
openaire   +6 more sources

Climate Backlash and Policy Dismantling: How Discursive Mechanisms Legitimised Radical Shifts in Swedish Climate Policy

open access: yesEnvironmental Policy and Governance, EarlyView.
ABSTRACT Climate backlash and policy dismantling, that is, the reversal of existing decarbonisation policies, can be observed in an increasing number of countries. Typically, policy change tends to be slow, while climate backlash can unfold quite fast. How is such rapid political change made possible?
Nora Förell, Anke Fischer
wiley   +1 more source

Cut Elimination for a Logic with Induction and Co-induction [PDF]

open access: yesarXiv, 2010
Proof search has been used to specify a wide range of computation systems. In order to build a framework for reasoning about such specifications, we make use of a sequent calculus involving induction and co-induction. These proof principles are based on a proof theoretic (rather than set-theoretic) notion of definition.
arxiv  

Condensed representations for Inductive Logic Programming [PDF]

open access: yes, 2004
ispartof: Ninth International Conference on the Principles of Knowledge Representation and Reasoning location:Delta Whistler Resort, Canada date:2 Jun - 5 Jun ...
De Raedt, Luc, Ramon, Jan
openaire   +2 more sources

Policy process theory development: Perspectives from European junior scholars

open access: yesEuropean Policy Analysis, EarlyView.
Abstract The development of policy process theories is progressing rapidly. Scholars increasingly apply these theories originated in the US to different contexts and continents, such as Europe. Furthermore, scholars at different career stages, including junior scholars, work on and with these theories.
Sandra Plümer   +2 more
wiley   +1 more source

Inductive logic program synthesis with DIALOGS [PDF]

open access: yes, 1997
DIALOGS (Dialogue-based Inductive and Abductive LOGic program Synthesizer) is a schema-guided synthesizer of recursive logic programs; it takes the initiative and queries a (possibly computationally naive) specifier for evidence in her/his conceptual language.
openaire   +3 more sources

Home - About - Disclaimer - Privacy