Filters








67,254 Hits in 7.0 sec

Higher-order logic programming [chapter]

Dale A. Miller, Gopalan Nadathur
1986 Lecture Notes in Computer Science  
We are grateful to Gilles Dowek for his comments on this chapter.  ...  Cut-elimination proofs for higher-order logics differ qualitatively from those for first-order logic in that they need techniques such as Girard's "candidats de réductibilité," whereas proofs in first-order  ...  As initially desired, this language provides for the usual higher-order programming features within logic programming.  ... 
doi:10.1007/3-540-16492-8_94 fatcat:zcqxdnpzhbglnfez7h3ih5xsgi

A treatment of higher-order features in logic programming [article]

Gopalan Nadathur
2004 arXiv   pre-print
The logic programming paradigm provides the basis for a new intensional view of higher-order notions.  ...  An extended compilation model is presented that treats higher-order unification and also handles dynamically emergent goals.  ...  Comments from the reviewers have helped in an improved presentation.  ... 
arXiv:cs/0404020v1 fatcat:aykcccwc2fe5vh6c36u62qeme4

Higher-order probabilistic adversarial computations: Categorical semantics and program logics [article]

Alejandro Aguirre, Gilles Barthe, Marco Gaboardi, Deepak Garg, Shin-ya Katsumata, Tetsuya Sato
2021 arXiv   pre-print
Under this view, an adversary is a higher-order expression that expects as arguments the code of its oracles.  ...  In this paper, we develop program logics for reasoning about adversarial computations in a higher-order setting.  ...  Figure 7 in Appendix A presents the (obvious) typing rules for these new constructs. HIGHER-ORDER UNARY LOGICS In this section, we describe two program logics for our language.  ... 
arXiv:2107.01155v1 fatcat:pvfuaokk3rcrtlkd63hdtkzn7i

Possibilistic Semantics for Logic Programs with Ordered Disjunction [chapter]

Roberto Confalonieri, Juan Carlos Nieves, Mauricio Osorio, Javier Vázquez-Salceda
2010 Lecture Notes in Computer Science  
In this paper we define a class of nested logic programs, nested logic programs with ordered disjunction (LP ODs + ), which allows to specify qualitative preferences by means of nested preference expressions  ...  For doing this we extend the syntax of logic programs with ordered disjunction (LPODs) to capture more general expressions.  ...  Acknowledgements The authors would like to thank the anonymous referees for their useful suggestions and comments. This research has been partially supported by ICT-ALIVE (FP7-215890).  ... 
doi:10.1007/978-3-642-11829-6_11 fatcat:tpqstzzeibciricj3r2c666xfm

Qualitative modelling via constraint programming

Thomas W. Kelsey, Lars Kotthoff, Christopher A. Jefferson, Stephen A. Linton, Ian Miguel, Peter Nightingale, Ian P. Gent
2014 Constraints  
Traditional applications are the study of the dynamics of physical and biological systems at a higher level of abstraction than that obtained by estimation of numerical parameter values for a fixed quantitative  ...  Qualitative modelling has been studied and implemented to varying degrees of sophistication in Petri nets, process calculi and constraint programming.  ...  We focus on three particular approaches, constraint programming (CP), temporal logics and process calculi.  ... 
doi:10.1007/s10601-014-9158-6 fatcat:5j3qjsfdmrdubb4acuaalrqki4

Programmed learning

Šárka Hošková-Mayerová, Zdena Rosická
2012 Procedia - Social and Behavioral Sciences  
Education system effectiveness at the time of advanced technologies, scope of interdisciplinary knowledge as well as simultaneous higher demands for experts in changing spheres of life is becoming hot  ...  Programmed learning-teaching process deals with control and currently is becoming almost irreplaceable component of subjects´ curricula.  ...  Algorithm as an expression may not be specified in programmed learning as an ultimate idea. It is understood as optimum logical system in order to study a particular problem, area or course.  ... 
doi:10.1016/j.sbspro.2011.12.141 fatcat:5jtalbqcyfgfbfibrbootccbi4

Using methods of declarative logic programming for intelligent information agents

THOMAS EITER, MICHAEL FINK, GIULIANA SABBATINI, HANS TOMPITS
2002 Theory and Practice of Logic Programming  
We then focus on declarative knowledge-representation methods, and review and evaluate approaches and methods from logic programming and nonmonotonic reasoning for information agents.  ...  In this paper, our interest lies in the role which some methods from the field of declarative logic programming can play in the realization of reasoning capabilities for information agents.  ...  Acknowledgments We would like to thank the anonymous referees for their constructive comments which helped to improve this paper.  ... 
doi:10.1017/s1471068402001576 fatcat:zy4b2jbtnje6righqsq4l2s324

Answer Set Programming [chapter]

Piero Bonatti, Francesco Calimeri, Nicola Leone, Francesco Ricca
2010 Lecture Notes in Computer Science  
Answer Set Programming (ASP), referred to also as Disjunctive Logic Programming under the stable model semantics (DLP), is a powerful formalism for Knowledge Representation and Reasoning.  ...  The Italian logic programming community has been very active in this area, some ASP results achieved in Italy are widely recognized as milestones on the road to the current state of the art.  ...  In [51] an extension of ASP, called HEX-Programs, which supports higher-order atoms as well as external atoms has been proposed.  ... 
doi:10.1007/978-3-642-14309-0_8 fatcat:m7vjxp43qfbgjpujf7ozr72x5q

ANSWER SET PROGRAMMING AND COMBINATORIAL MULTICRITERIA DECISION MAKING

RAFAL GRABOŚ
2006 International Journal of Uncertainty Fuzziness and Knowledge-Based Systems  
In this paper Logic Programming with Ordered Disjunction (LPOD), an extension of answer set programming for handling preferences, is used for representing and solving combinatorial vote problems.  ...  Various vote rules, used as procedures for determining optimal candidate for a group of voters, are defined by means of preference relations between answer sets of a program, representing a vote problem  ...  Logic programming with ordered disjunction has been invented by Brewka [2] as an extension of answer set programming [11] to represent priority among literals and rules in a program.  ... 
doi:10.1142/s0218488506004096 fatcat:vel32z6hqneg3nni3jfu6gcu5a

Action Programming Languages

Michael Thielscher
2008 Synthesis Lectures on Artificial Intelligence and Machine Learning  
Second-order logic adds sorted variables for predicates and functions to the language of firstorder logic.  ...  The action programming language GOLOG, an acronym for Algol in Logic, combines actions and fluents with standard constructs from procedural programming languages.  ...  It provides a syntax for encoding the belief base and for defining a set of procedures for an 72 ACTION PROGRAMMING LANGUAGES agent.  ... 
doi:10.2200/s00143ed1v01y200807aim005 fatcat:hustp4b775dgjikqhvxnuxe5k4

Using Methods of Declarative Logic Programming for Intelligent Information Agents [article]

T. Eiter, M. Fink, G. Sabbatini, H. Tompits
2001 arXiv   pre-print
We then focus on declarative knowledge-representation methods, and review and evaluate approaches from logic programming and nonmonotonic reasoning for information agents.  ...  In this paper, our interest is in the role which some methods from the field of declarative logic programming can play in the realization of reasoning capabilities for information agents.  ...  Acknowledgments We would like to thank the anonymous referees for their constructive comments which helped to improve this paper.  ... 
arXiv:cs/0108008v1 fatcat:tg6xs5g2qfhypinc7rvjv2v2t4

Preferred answer sets for extended logic programs

Gerhard Brewka, Thomas Eiter
1999 Artificial Intelligence  
In such programs an ordering on the program rules is used to express preferences.  ...  In this paper, we address the issue of how Gelfond and Lifschitz's answer set semantics for extended logic programs can be suitably modified to handle prioritized programs.  ...  Marek for bibliographic hints on well-orderings, and to H. Blair and A. Nerode for discussions on this subject. This work was partially supported by the Austrian Science Fund Project N Z29-INF.  ... 
doi:10.1016/s0004-3702(99)00015-6 fatcat:ur74nizcxfd7bp72iphvqwqzpa

Knowledge representation with logic programs [chapter]

Gerhard Brewka, Jürgen Dix
1998 Lecture Notes in Computer Science  
In this tutorial-overview, which resulted from a lecture course given by the authors at the European Summer School in Logic, Language and Information 1997 in Aix-en-Provence (  ...  Herbrand-Models and the underlying language Usually when we represent some knowledge in first order logic or even in logic programs, it is understood that the underlying language is given exactly by the  ...  An Application: Qualitative Decision Making In this section we want to discuss a somewhat more realistic example and show how prioritized logic programs can be used for qualitative decision making.  ... 
doi:10.1007/bfb0054788 fatcat:5fa5wrvqgnco5kdgef2zcsrysm

Strategic directions in constraint programming

Pascal Van Hentenryck, Vijay Saraswat
1996 ACM Computing Surveys  
Particular thanks to Vineet Gupta for invaluable last-minute assistance.  ...  For example, attention is being paid to overconstrained systems [Jampel et al. 1996] , where preferences must be expressed.  ...  A constraint object is usually represented by a collection of atomic constraints, such as real polynomial, linear, or dense order, and their logical combinations.  ... 
doi:10.1145/242223.242279 fatcat:3aqe7rubijeddoahomxho2vtou

Constraint logic programming for qualitative and quantitative constraint satisfaction problems

Ho Geun Lee, Ronald M. Lee, Gang Yu
1996 Decision Support Systems  
Constraint Logic Programming (CLP), which combines these complementary strengths of the AI and OR approach, is introduced as a new tool to formalize a special class of constraint satisfaction problems  ...  that include both qualitative and quantitative constraints.  ...  Constraint logic programming The CLP scheme and CLP(~) The CLP scheme represents a framework for the formal foundation of a programming language class that combines logic programming and constraint solving  ... 
doi:10.1016/0167-9236(94)00057-3 fatcat:jk7pr2orundndlejbinymr3d3i
« Previous Showing results 1 — 15 out of 67,254 results