Tabling for non‐monotonic programmingSpringer Science and Business Media LLC - Tập 25 - Trang 201-240 - 1999
Terrance Swift
Non‐monotonic extensions add power to logic programs. However, the main logic
programming language, Prolog, is widely recognized as inadequate to implement
these extensions due to its weak termination and complexity properties. By
extending Prolog’s SLD resolution with tabling, Prolog can be improved in
several ways. Tabling can allow a logic programming system to compute the
well‐founded semantic... hiện toàn bộ
Automated generation of geometric theorems from images of diagramsSpringer Science and Business Media LLC - Tập 74 - Trang 333-358 - 2014
Xiaoyu Chen, Dan Song, Dongming Wang
We propose an approach to generate geometric theorems from electronic images of
diagrams automatically. The approach makes use of techniques of Hough transform
to recognize geometric objects and their labels and of numeric verification to
mine basic geometric relations. Candidate propositions are generated from the
retrieved information by using six strategies and geometric theorems are
obtained f... hiện toàn bộ
On multivariate network analysis of statistical data sets with different measures of associationSpringer Science and Business Media LLC - Tập 76 - Trang 83-92 - 2015
Valery A. Kalyagin, Alexander P. Koldanov, Panos M. Pardalos
The main goal of the present paper is the development of a general framework of
multivariate network analysis of statistical data sets. A general method of
multivariate network construction, on the basis of measures of association, is
proposed. In this paper we consider Pearson correlation network, sign similarity
network, Fechner correlation network, Kruskal correlation network, Kendall
correlati... hiện toàn bộ
Learning from masked analogies between sentences at multiple levels of formalitySpringer Science and Business Media LLC - - Trang 1-25 - 2023
Liyan Wang, Yves Lepage
This paper explores the inference of sentence analogies not restricted to the
formal level. We introduce MaskPrompt, a prompt-based method that addresses the
analogy task as masked analogy completion. This enables us to fine-tune, in a
lightweight manner, pre-trained language models on the task of reconstructing
masked spans in analogy prompts. We apply constraints which are approximations
of the ... hiện toàn bộ
Cost-aware sequential diagnosticsSpringer Science and Business Media LLC - - Trang 1-17 - 2022
Bernhard Ganter
A simple search problem is studied in which a binary n-tuple is to be found in a
list, by sequential bit comparisons with cost. The problem can be solved (for
small n) using dynamic programming. We show how the “bottom up” part of the
algorithm can be organized by means of Formal Concept Analysis.
A new definition for feature selection stability analysisSpringer Science and Business Media LLC -
Teddy Lazebnik, Avi Rosenfeld
AbstractFeature selection (FS) stability is an important topic of recent
interest. Finding stable features is important for creating reliable,
non-overfitted feature sets, which in turn can be used to generate machine
learning models with better accuracy and explanations and are less prone to
adversarial attacks. There are currently several definitions of FS stability
that are widely used. In this... hiện toàn bộ
New tractable classes for default reasoning from conditional knowledge basesSpringer Science and Business Media LLC - Tập 45 - Trang 275-291 - 2005
Berilhes Borges Garcia
This paper refines the tractability/intractability frontier of default reasoning
from conditional knowledge bases. It presents two new tractable cases with
relation to lexicographic entailment. In particular, we have introduced nested
conditional knowledge bases and co-nested conditional knowledge bases, which are
meaningful conditional knowledge bases. Both tractable classes presented in this
pap... hiện toàn bộ
Logical considerations on default semanticsSpringer Science and Business Media LLC - Tập 20 - Trang 195-226 - 1997
William C. Rounds, Guo‐Qiang Zhang
We consider a reinterpretation of the rules of default logic. We make Reiter’s
default rules into a constructive method of building models, not theories. To
allow reasoning in first‐order systems, we equip standard first‐order logic with
a (new) Kleene 3‐valued partial model semantics. Then, using our methodology, we
add defaults to this semantic system. The result is that our logic is an
ordinary... hiện toàn bộ
Factorization of fuzzy concept lattices with hedges by modification of input dataSpringer Science and Business Media LLC - Tập 59 - Trang 187-200 - 2010
Michal Krupka
We study the problem of reducing the size of fuzzy concept lattices with hedges
by means of factorization. As it has been shown previously for the case of fuzzy
concept lattices without hedges, the lattice computed by factorization of a
fuzzy concept lattice is isomorphic to a fuzzy concept lattice of some other
data table. This means that the factor concept lattice can be computed directly
as a c... hiện toàn bộ
On the decentralized coordination of herding activities: a Jadex-based solutionSpringer Science and Business Media LLC - Tập 59 - Trang 411-426 - 2010
Gregor Balthasar, Jan Sudeikat, Wolfgang Renz
The AgentContest 2009 provided a revised Cows and Herders scenario which
extended the last year’s setting. First, additional environment objects, i.e.,
fences and switches, were introduced. Secondly, the team score is calculated by
the net amount of herded cows at the game end. In this paper we present the
design of the multi-agent system (MAS) prototype which participated in this
contest and has ... hiện toàn bộ