A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Filters
Learning Structure and Parameters of Stochastic Logic Programs
[chapter]
2003
Lecture Notes in Computer Science
Preserved Fulltext
Previous papers have studied learning of Stochastic Logic Programs (SLPs) either as a purely parametric estimation problem or separated structure learning and parameter estimation into separate phases. ...
In this paper we consider ways in which both the structure and the parameters of an SLP can be learned simultaneously. ...
This takes a goal p:G and a labelled clause q:C and produces the labelled goal pq:R, where R is the SLD resolvent of G and C. The answer probability of D S,G is Q(D S,G ) = n i=1 p i . ...
doi:10.1007/3-540-36468-4_13
fatcat:3pb5d4zyhbablfr4mhnkpciume
LGML: Logic Guided Machine Learning
[article]
2021
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
Other Versions
We introduce Logic Guided Machine Learning (LGML), a novel approach that symbiotically combines machine learning (ML) and logic solvers with the goal of learning mathematical functions from data. ...
LGML consists of two phases, namely a learning-phase and a logic-phase with a corrective feedback loop, such that, the learning-phase learns symbolic expressions from input data, and the logic-phase cross ...
Introduction to LGML We propose a new method of combining machine learning (the learning-phase) and logic solvers (the logic-phase) in a corrective feedback loop from the logic-phase to the learning-phase ...
arXiv:2006.03626v2
fatcat:brivnhuyu5axnmvpglvt7uy3di
Clausal Proofs and Discontinuity
1995
Logic Journal of the IGPL
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
The correctness condition on proof nets ('long trip condition') can be implemented by SLD resolution in linear logic with uni cation on labels/terms limited to one way matching. ...
The prosodic (sublinear) aspects are encoded in labels, in e ect the term-structure of quanti ed linear logic. ...
de ned by: GOAL ::= AT OM (5.16) For the higher order case the notion of GOAL is generalised to include implications: GOAL ::= AT OM j GOAL PCLS (5.17) In linear logic programming each rule is resource-conscious ...
doi:10.1093/jigpal/3.2-3.403
fatcat:dd2uscjnobhgjajrwi4otegciy
Fuzzy XPath for the Automatic Search of Fuzzy Formulae Models
[chapter]
2015
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
We re-use a previous method based on fuzzy logic programming where the formula is conceived as a goal whose derivation tree, provided by our FLOPER tool, contains on its leaves all the models of the original ...
Instead of focusing on satisfiability (i.e., proving the existence of at least one model) as usually done in a SAT/SMT setting, our interest moves to the problem of finding the whole set of models (with ...
-If & is a conjunction of a certain logic "label" in the original formula, then it is denoted as "&label" in goal F . ...
doi:10.1007/978-3-319-23540-0_26
fatcat:5lxjthni3vcfjedgcd5ktfovve
Non-termination analysis of logic programs with integer arithmetics
2011
Theory and Practice of Logic Programming
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Other Versions
As a first step towards the analysis of Prolog programs, this paper presents a non-termination condition for Logic Programs containing integer arithmetics. ...
In first phase, we ignore the outcome (success or failure) of the arithmetic operations, assuming success of all arithmetic calls. ...
The inference and proof are done in two phases. In the first phase, non-termination of the logic part of the program is proven by assuming that all comparisons between integer expressions succeed. ...
doi:10.1017/s1471068411000159
fatcat:zvjyjzvj4rbm5l3gqhdnzgzmzu
A Requirements-Driven and Aspect-Oriented Approach for Evolution of Web Services Composition
2009
2009 Second Pacific-Asia Conference on Web Mining and Web-based Application
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
The result is to make business level person capable of taking part in evolution modeling at requirements phase. ...
Goal models depict users' desires in terms of goals, namely, why-to-do; BPEL provides means to describe web service composition using WS-BPEL2.0, namely, how-to-do. ...
Condition Expressing is a logic expression which represents the continuous condition. For instance, Stock quality >= 50 ton is an instance of Condition Expression. ...
doi:10.1109/wmwa.2009.79
fatcat:s3v7y43itfgfboewzpveif45eq
Employing Learning to Improve the Performance of Meta-RaPS
2013
Procedia Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Various forms of memory have been used to achieve this goal and improve the performance of metaheuristics, which warranted the development of the Adaptive Memory Programming (AMP) framework [1]. ...
Similar to most metaheuristics, Meta-RaPS consists of construction and improvement phases. Randomness coupled with a greedy heuristic are typically employed in the construction phase. ...
The proposed labels are: follow original logic, improve superior solution, or update the values of Meta-RaPS parameters. ...
doi:10.1016/j.procs.2013.09.237
fatcat:7cyrseptrzh7pbfhkgjmqa6e5m
Deriving non-Zeno behaviour models from goal models using ILP
2009
Formal Aspects of Computing
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
First, a given goal model, formalised in Linear Temporal Logic (LTL), is automatically translated into a (potentially Zeno) Labelled Transition System (LTS). ...
Identification of Zeno traces is achieved by model checking the LTS model against a time progress property expressed in LTL, while pre-conditions are learned using Inductive Logic Programming (ILP). ...
peer-00523663, version 1 -6 Oct 2010 Deriving Non-Zeno Behaviour Models from Goal Models using ILP ...
doi:10.1007/s00165-009-0128-5
fatcat:crgcptvox5bwtd34erhlzpuqwi
Goal-conflict detection based on temporal satisfiability checking
2016
Proceedings of the 31st IEEE/ACM International Conference on Automated Software Engineering - ASE 2016
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
pre-determined formulations of boundary conditions. ...
We present a novel automated approach to compute boundary conditions for general classes of conflicting goals expressed in LTL, using a tableaux-based LTL satisfiability procedure. ...
The second condition states that removing any of the goals no longer results in a logical inconsistency. The third condition prohibits a boundary condition to be simply the negation of goals. ...
doi:10.1145/2970276.2970349
dblp:conf/kbse/DegiovanniRACA16
fatcat:z755mrbsvreshivvazuysppugy
Generating obstacle conditions for requirements completeness
2012
2012 34th International Conference on Software Engineering (ICSE)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Obstacle analysis is a goal-anchored form of risk analysis whereby exceptional conditions that may obstruct system goals are identified, assessed and resolved to produce complete requirements. ...
This paper describes a tool-supported technique for generating a set of obstacle conditions guaranteed to be complete and consistent with respect to the known domain properties. ...
ACKNOWLEDGMENT We are grateful to Bernard Lambeau and the reviewers for their careful inspection and feedback on an earlier version of the paper. ...
doi:10.1109/icse.2012.6227147
dblp:conf/icse/AlrajehKLRU12
fatcat:kvgut6yvx5csbimsivmo2fg5gy
PowerQuest: Trace Driven Data Mining for Power Optimization
2007
2007 Design, Automation & Test in Europe Conference & Exhibition
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2007; you can also visit the original URL.
The file type is application/pdf.
The advantages of PowerQuest in comparison with other state-ofthe-art Dynamic Power Management (DPM) techniques are: 1) Quality of ODC conditions for gating 2) Minimization of extra logic added for gating ...
through detection of gating conditions. ...
,F k } needed to classify the positive and negative data points (clock phases) of the traces with respect to a splitting criteria identified by label L. ...
doi:10.1109/date.2007.364437
fatcat:r7c23lungngohb5u5ond76suyi
Deriving fold/unfold transformations of logic programs using extended OLDT-based abstract interpretation
1993
Journal of symbolic computation
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Given the queried logic program P and the initial goal ~ e(V1,..., V~), a computed answer substitution for the initial goal of P is obtained by restricting the composition of 81...8k to the variables V1 ...
So, in this paper, we propose a general framework for deriving different fold/unfold transformations of definite logic programs. The transformation consists of two phases. ...
Schreye for pointing out that the method presented in [Boulanger,D. (1992) ] is unable to cope with several important applications and for many stimulating discussions which motivated the development of ...
doi:10.1016/s0747-7171(06)80003-9
fatcat:73rc467cezepherk3harm3kmk4
And-parallel execution of logic programs on a shared-memory multiprocessor
1991
The Journal of Logic Programming
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Our implementation of this model is based upon the Warren Abstract Machine (WAM); hence it retains most of the efficiency of the WAM for sequential segments of logic programs. ...
t> This paper presents the implementation and performance results of an ANn-parallel execution model of logic programs on a shared-memory multiprocessor. ...
The quality of presentation in this paper has substantially improved due to comments by anonymous referees on an earlier draft of this paper. ...
doi:10.1016/0743-1066(91)80003-v
fatcat:q2czzi6fevhnbfqluxphpjb23m
Compliant Business Processes with Exclusive Choices from Agent Specification
[chapter]
2015
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2016; you can also visit the original URL.
The file type is application/pdf.
In this paper we analyse the problem of synthesising compliant business processes from rules-based declarative specifications for agents. ...
In particular, we consider the approach by [1,2] and we propose computationally efficient algorithms to combine plans extracted from the deliberation of an agent to generate the corresponding business ...
., the BDI architecture) distinguish three phases: the deliberation phase where agents deliberate what are their goals; then in the plan selection phase, the agent selects, based on the outcome of the ...
doi:10.1007/978-3-319-25524-8_43
fatcat:uqtlgntrlzbzlgoyyttbb7abnm
Formal Specification Based Automatic Test Generation for Embedded Network Systems
2014
Journal of Applied Mathematics
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Through the experiments, we confirmed the efficiency of our approach in design and test generation of real embedded air-conditioning network systems. ...
Our approach is summarized as follows: (1) A user describes requirements of target embedded network systems by logical property-based constraints usingSENS. (2) GivenSENSspecifications, test cases are ...
Acknowledgments The authors thank Takao Sonoda, Shouichi Hasuike, Munekazu Huruichi, Keiichi Shimatani, and Hayato Shikata of DaiKin Industries for their great contribution in their joint project. ...
doi:10.1155/2014/909762
fatcat:4alaefuoovdznh4zka6rz4rhhi
« Previous
Showing results 1 — 15 out of 146,992 results