|
Vladimir Lifschitz
Vladimir Lifschitz (born 30 May 1947) is the Gottesman Family Centennial Professor in Computer Sciences at the University of Texas at Austin. He received a degree in mathematics from the Steklov Institute of Mathematics in Russia in 1971 and emigrated to the United States in 1976. Lifschitz's research interests are in the areas of computational logic and knowledge representation. He is a Fellow of the Association for the Advancement of Artificial Intelligence, the Editor-in-Chief of the ACM Transactions on Computational Logic, and an Editorial Advisor of the journal ''Theory and Practice of Logic Programming''. He, together with Michael Gelfond, defined stable model semantics for logic programs, which later became the theoretical foundation for Answer Set Programming,Victor Marek and Miroslaw Truszczynski. Stable models and an alternative logic programming paradigm. In The Logic Programming Paradigm: a 25-Year Perspective, pages 375-398. Springer Verlag, 1999 a new declarative pro ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
The University Of Texas At Austin
The University of Texas at Austin (UT Austin, UT, or Texas) is a public research university in Austin, Texas. It was founded in 1883 and is the oldest institution in the University of Texas System. With 40,916 undergraduate students, 11,075 graduate students and 3,133 teaching faculty as of Fall 2021, it is also the largest institution in the system. It is ranked among the top universities in the world by major college and university rankings, and admission to its programs is considered highly selective. UT Austin is considered one of the United States's Public Ivies. The university is a major center for academic research, with research expenditures totaling $679.8 million for fiscal year 2018. It joined the Association of American Universities in 1929. The university houses seven museums and seventeen libraries, including the LBJ Presidential Library and the Blanton Museum of Art, and operates various auxiliary research facilities, such as the J. J. Pickle Research Ca ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Steklov Institute Of Mathematics
Steklov Institute of Mathematics or Steklov Mathematical Institute (russian: Математический институт имени В.А.Стеклова) is a premier research institute based in Moscow, specialized in mathematics, and a part of the Russian Academy of Sciences. The institute is named after Vladimir Andreevich Steklov, who in 1919 founded the Institute of Physics and Mathematics in Leningrad. In 1934, this institute was split into separate parts for physics and mathematics, and the mathematical part became the Steklov Institute. At the same time, it was moved to Moscow. The first director of the Steklov Institute was Ivan Matveyevich Vinogradov. From 19611964, the institute's director was the notable mathematician Sergei Chernikov. The old building of the Institute in Leningrad became its Department in Leningrad. Today, that department has become a separate institute, called the ''St. Petersburg Department of Steklov Institute of Mathematics of Russian Academy ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Computational Logic
Computational logic is the use of logic to perform or reason about computation. It bears a similar relationship to computer science and engineering as mathematical logic bears to mathematics and as philosophical logic bears to philosophy. It is synonymous with "logic in computer science". The term “computational logic” came to prominence with the founding of the ACM Transactions on Computational Logic in 2000. However, the term was introduced much earlier, by J.A. Robinson in 1970. The expression is used in the second paragraph with a footnote claiming that "computational logic" is ''"surely a better phrase than 'theorem proving', for the branch of artificial intelligence which deals with how to make machines do deduction efficiently"''. In 1972 the Metamathematics Unit at the University of Edinburgh was renamed “The Department of Computational Logic” in the School of Artificial Intelligence.http://homepages.inf.ed.ac.uk/bundy/ Professor Alan Bundy's website The term wa ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Knowledge Representation
Knowledge representation and reasoning (KRR, KR&R, KR²) is the field of artificial intelligence (AI) dedicated to representing information about the world in a form that a computer system can use to solve complex tasks such as diagnosing a medical condition or having a dialog in a natural language. Knowledge representation incorporates findings from psychology about how humans solve problems and represent knowledge in order to design formalisms that will make complex systems easier to design and build. Knowledge representation and reasoning also incorporates findings from logic to automate various kinds of ''reasoning'', such as the application of rules or the relations of sets and subsets. Examples of knowledge representation formalisms include semantic nets, systems architecture, frames, rules, and ontologies. Examples of automated reasoning engines include inference engines, theorem provers, and classifiers. History The earliest work in computerized knowledge represe ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Association For The Advancement Of Artificial Intelligence
The Association for the Advancement of Artificial Intelligence (AAAI) is an international scientific society devoted to promote research in, and responsible use of, artificial intelligence. AAAI also aims to increase public understanding of artificial intelligence (AI), improve the teaching and training of AI practitioners, and provide guidance for research planners and funders concerning the importance and potential of current AI developments and future directions. History The organization was founded in 1979 under the name "American Association for Artificial Intelligence" and changed its name in 2007 to "Association for the Advancement of Artificial Intelligence". It has in excess of 4,000 members worldwide. In its early history, the organization was presided over by notable figures in computer science such as Allen Newell, Edward Feigenbaum, Marvin Minsky and John McCarthy. The current president is Yolanda Gil, and the president elect is Bart Selman. Conferences and publica ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
ACM Transactions On Computational Logic
''ACM Transactions on Computational Logic'' (''ACM TOCL'') is a scientific journal that aims to disseminate the latest findings of note in the field of logic in computer science. It is published by the Association for Computing Machinery, a premier scientific and educational society on computer science and computational technology in the United States. The editor-in-chief is Anuj Dawar (University of Cambridge). According to the ''Journal Citation Reports'', the journal had a 2020 impact factor of 0.625. See also *ACM SIGLOG ACM SIGLOG or SIGLOG is the Association for Computing Machinery Special Interest Group on Logic and Computation. It publishes a news magazine (''SIGLOG News''), and has the annual ACM-IEEE Symposium on Logic in Computer Science (LICS) as its flag ..., ACM's Special Interest Group on Computational Logic References External links *{{Official website, 1=http://tocl.acm.org/ Transactions on Computational Logic Computer science journals Logic in computer ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Michael Gelfond
Michael Gelfond is a Professor in Computer Sciences at Texas Tech University in the United States. He received a degree in mathematics from the Steklov Institute of Mathematics in Russia in 1974 and emigrated to the United States in 1978. Gelfond's research interests are in the areas of computational logic and knowledge representation. He is a Fellow of the Association for the Advancement of Artificial Intelligence, and an Area Editor (in Knowledge Representation and Nonmonotonic Reasoning) of the journal ''Theory and Practice of Logic Programming''. He, together with Vladimir Lifschitz, defined stable model semantics for logic programs, which later became the theoretical foundation for Answer Set Programming Answer set programming (ASP) is a form of declarative programming oriented towards difficult (primarily NP-hard) search problems. It is based on the stable model (answer set) semantics of logic programming. In ASP, search problems are reduced ...,Victor Marek and Mirosla ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Stable Model Semantics
The concept of a stable model, or answer set, is used to define a declarative semantics for logic programs with negation as failure. This is one of several standard approaches to the meaning of negation in logic programming, along with program completion and the well-founded semantics. The stable model semantics is the basis of answer set programming. Motivation Research on the declarative semantics of negation in logic programming was motivated by the fact that the behavior of SLDNF resolution — the generalization of SLD resolution used by Prolog in the presence of negation in the bodies of rules — does not fully match the truth tables familiar from classical propositional logic. Consider, for instance, the program :p\ :r \leftarrow p,\ q :s \leftarrow p,\ \operatorname q. Given this program, the query will succeed, because the program includes as a fact; the query will fail, because it does not occur in the head of any of the rules. The query will fail also ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Answer Set Programming
Answer set programming (ASP) is a form of declarative programming oriented towards difficult (primarily NP-hard) search problems. It is based on the stable model (answer set) semantics of logic programming. In ASP, search problems are reduced to computing stable models, and ''answer set solvers''—programs for generating stable models—are used to perform search. The computational process employed in the design of many answer set solvers is an enhancement of the DPLL algorithm and, in principle, it always terminates (unlike Prolog query evaluation, which may lead to an infinite loop). In a more general sense, ASP includes all applications of answer sets to knowledge representation and the use of Prolog-style query evaluation for solving problems arising in these applications. History An early example of answer set programming was the planning method proposed in 1997 by Dimopoulos, Nebel and Köhler. Their approach is based on the relationship between plans and stable model ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Declarative Programming
In computer science, declarative programming is a programming paradigm—a style of building the structure and elements of computer programs—that expresses the logic of a computation without describing its control flow. Many languages that apply this style attempt to minimize or eliminate side effects by describing ''what'' the program must accomplish in terms of the problem domain, rather than describe ''how'' to accomplish it as a sequence of the programming language primitives (the ''how'' being left up to the language's implementation). This is in contrast with imperative programming, which implements algorithms in explicit steps. Declarative programming often considers programs as theories of a formal logic, and computations as deductions in that logic space. Declarative programming may greatly simplify writing parallel programs. Common declarative languages include those of database query languages (e.g., SQL, XQuery), regular expressions, logic programming, functio ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Living People
Related categories * :Year of birth missing (living people) / :Year of birth unknown * :Date of birth missing (living people) / :Date of birth unknown * :Place of birth missing (living people) / :Place of birth unknown * :Year of death missing / :Year of death unknown * :Date of death missing / :Date of death unknown * :Place of death missing / :Place of death unknown * :Missing middle or first names See also * :Dead people * :Template:L, which generates this category or death years, and birth year and sort keys. : {{DEFAULTSORT:Living people 21st-century people People by status ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
American Computer Scientists
American(s) may refer to: * American, something of, from, or related to the United States of America, commonly known as the "United States" or "America" ** Americans, citizens and nationals of the United States of America ** American ancestry, people who self-identify their ancestry as "American" ** American English, the set of varieties of the English language native to the United States ** Native Americans in the United States, indigenous peoples of the United States * American, something of, from, or related to the Americas, also known as "America" ** Indigenous peoples of the Americas * American (word), for analysis and history of the meanings in various contexts Organizations * American Airlines, U.S.-based airline headquartered in Fort Worth, Texas * American Athletic Conference, an American college athletic conference * American Recordings (record label), a record label previously known as Def American * American University, in Washington, D.C. Sports teams Soccer * ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
