1,3 LIU Jianbing, DU Junshu, 3 REN Hong, Faculty of Economics and Management , Jiangxi University of Science and Technology, Ganzhou Jiangxi 341000, China,[email protected] School of Business of East China University of Science and Technology,Shanghai 200237,China, [email protected] 3 Faculty of Construction Management and Real Estate , Chongqing University, Chongqing 400030 , China, renho...

We provide a simple formulation of a framework where some extensions of logic programming with non-monotonic reasoning are treated uniformly, namely two kinds of negation and abduction. The resulting semantics is purely model-theoretic, and gives meaning to any non-contradictory abductive logic program. Moreover, it embeds and generalizes some existing semantics which deal with negation and abd...

In this paper, a look-up table control strategy derived from a fuzzy logic controller is developed for output regulation of a SISO linear plant with delay subject to load changes and transfer between different operating points. The strategy considers an off-line trained look-up table for rejection of an unity load step change and another one trained for unity reference step tracking combined in...

In the Claytronics project, we have used Meld, a logic programming language suitable for writing scalable and concise distributed programs for ensembles. Meld allows declarative code to be compiled into distributed code that can be executed in thousands of computing units. We are now using Meld to program more traditional algorithms that run on multicore machines. We made several modifications ...

SAT solvers are often challenged with very hard problems that remain unsolved after hours of CPU time. The research community meets the challenge in two ways: (1) by improving the SAT solver technology, for example, perfecting heuristics for variable ordering, and (2) by inventing new ways of constructing simpler SAT problems, either using domain specific information during the translation from...

This paper presents a speed-up learning method for logic programs, which accelerates a program by composing macro clauses based on partial structures of proof trees. Many systems have been proposed for composing useful macros, e.g., some of them select macros that connects two peaks in a heuristic function. Another employs heuristics that select useful macros. Although they work well in some do...

Probabilistic Logic Programming (PLP) allows to represent domains containing many entities connected by uncertain relations and has many applications in particular in Machine Learning. PITA is a PLP algorithm for computing the probability of queries that exploits tabling, answer subsumption and Binary Decision Diagrams (BDDs). PITA does not impose any restriction on the programs. Other algorith...

Introduction Markov logic networks (Domingos and Lowd 2009) (MLNs) combine the power of first-order logic and probabilistic graphical models and as a result are ideally suited for solving large, complex problems in application domains (e.g., NLP, computer vision, the Web, etc.) that have both rich relational structure and large amount of uncertainty. However, inference in these rich, relational...

this paper proposes an approach for the minimum time swing upof a rotary inverted pendulum. our rotary inverted pendulum is supported bya pivot arm. the pivot arm rotates in a horizontal plane by means of a servomotor. the opposite end of the arm is instrumented with a joint whose axisis along the radial direction of the motor. a pendulum is suspended at thejoint. the task is to design a contro...