to use soil hydrology processes (shp) models, which have increasingly extended during the last years, comprehensive knowledge about these models and their modeling approaches seems to be necessary. the modeling approaches can be categorized as either classical or non-classical. classical approaches mainly model the shp through solving the general unsaturated flow (richards) equation, numericall...

D We describe a novel logic, called HiLog, and show that it provides a more suitable basis for logic programming than does traditional predicate logic. HiLog has a higher-order syntax and allows arbitrary terms to appear in places where predicates, functions, and atomic formulas occur in predicate calculus. But its semantics is first-order and admits a sound and complete proof procedure. Applic...

Deterministic, parallel set-term uniication algorithms for high-order logic-based database languages, of which set terms have the commutative and idempotent properties , are lacking. As a result, an eecient inference mechanism that can be used to determine answers to queries of these database languages deterministically is non-existent. To overcome these shortcomings, we propose a set-term unii...

This paper examines critically the contributions of Cournot, Jevons and Walras as the founders of classical mathematical economics from a methodological standpoint. Advances in different economic schools and doctrines in the 19th century produced an environment of multi-dimensionality in economic analysis which was regarded by the pioneers of classical mathematical economists as a chaotic state...

The paper explores “logic+control” programming paradigm, applied to a relational domain. Even though it looks natural to utilize first order logic as a database query language, the paper reveals some shortcomings of such an approach. Particular attention is paid to: a) the semantics of negation and other non-monotonic reasoning notions, b) infinite or time consuming recursions, c) embedded PROL...

Dung’s argumentation framework is an abstract framework based on a set of arguments and a binary attack relation defined over the set. One instantiation, among many others, of Dung’s framework consists in constructing the arguments from a set of propositional logic formulas. Thus an argument is seen as a reason for or against the truth of a particular statement. Despite its advantages, the argu...

Characterization results for modal logics below first order identifies them as a fragment of first order logic. These results are very important to analyze the expressive power of a given logic. The first work in this direction was done by van Benthem [12] who used bisimulations to characterize the basic modal logic as the bisimulation invariant fragment of first order logic. There exists a hug...

This paper presents a distributed agent-based automated theorem proving framework based on ordersorted first-order logic. Each agent in our framework has its own knowledge base, communicating to its neighboring agent(s) using message-passing algorithms. The communication language between agents is restricted in such a manner that each agent can only communicate to its neighboring agent(s) by me...

We consider first-order infinite-valued Łukasiewicz logic and its expansion, rational Pavelka RPL∀. From the viewpoint of provability, we compare several Gentzen-type hypersequent calculi for these logics with each other Hájek’s Hilbert-type same logics. To facilitate comparing previously known logics, define two new analytic RPL∀ include them in our comparison. The key part comparison is a den...